The Parameterized Complexity of Reasoning Problems

View Statistics Email Alert RSS Feed

Primary Data

Project Acronym Projekt Kurzbezeichnung
Complex Reason
 
Project Title (de) Projekttitel (de)
The Parameterized Complexity of Reasoning Problems
 
Project Title (en) Projekttitel (en)
The Parameterized Complexity of Reasoning Problems
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 

Grants

Funder/Funding Agency Fördergeber
Europäischer Forschungsrat (ERC)
Grant number Förderkennnummer
239962
 

Publications

Filter:
Author:  SZEIDER, STEFAN

Results 1-14 of 14 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Gaspers, Serge ; Szeider, Stefan Guarantees and limits of preprocessing in constraint satisfaction and reasoningArtikel Article2014
2PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable answer-set programming with weight constraints: bounded treewidth is not enoughArtikel Article2014
3Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulasArtikel Article 2013
4Ordyniak, S. ; Szeider, S. Parameterized Complexity Results for Exact Bayesian Network Structure LearningArtikel Article 2013
5Dvořák, Wolfgang ; Ordyniak, Sebastian ; Szeider, Stefan Augmenting Tractable Fragments of Abstract ArgumentationArtikel Article2012
6PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not EnoughArtikel Article2012
7Gutin, Gregory ; Kim, Eun Jung ; Soleimanfallah, Arezou ; Szeider, Stefan ; Yeo, Anders Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint ProgrammingArtikel Article2012
8van ’t Hof, Pim ; Kamiński, Marcin ; Paulusma, Daniël ; Szeider, Stefan ; Thilikos, Dimitrios M. On Graph Contractions and Induced MinorsArtikel Article2012
9Alon, Noga ; Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders Solving MAX-r-SAT Above a Tight Lower BoundArtikel Article2011
10Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan Algorithms and Complexity Results for Persuasive ArgumentationArtikel Article2011
11Szeider, Stefan Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsArtikel Article2011
12Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders A Probabilistic Approach to Problems Parameterized Above or Below Tight BoundsArtikel Article2011
13Szeider, Stefan The Parameterized Complexity of k-Flip Local Search for SAT and MAX SATArtikel Article2011
14Broersma, Hajo ; Dantchev, Stefan S. ; Johnson, Matthew ; Szeider, Stefan Journal of Discrete Algorithms 8(2) - EditorialArtikel Article2010