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

Results 1-20 of 21 (Search time: 0.003 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Ganian, Robert ; Hliněný, Petr ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter ; Sikdar, Somnath Lower bounds on the complexity of MSO₁ model-checkingArtikel Article Feb-2014
2Ganian, Robert ; Hliněný, Petr ; Kneis, Joachim ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter Digraph Width Measures in Parameterized AlgorithmicsArtikel Article2014
3Gaspers, Serge ; Szeider, Stefan Guarantees and limits of preprocessing in constraint satisfaction and reasoningArtikel Article2014
4PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable answer-set programming with weight constraints: bounded treewidth is not enoughArtikel Article2014
5Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulasArtikel Article 2013
6Ordyniak, S. ; Szeider, S. Parameterized Complexity Results for Exact Bayesian Network Structure LearningArtikel Article 2013
7Dvořák, Wolfgang ; Ordyniak, Sebastian ; Szeider, Stefan Augmenting Tractable Fragments of Abstract ArgumentationArtikel Article2012
8Gaspers, Serge ; Liedloff, Mathieu A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating SetArtikel Article2012
9Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu On Independent Sets and Bicliques in GraphsArtikel Article2012
10PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not EnoughArtikel Article2012
11Gutin, 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
12van ’t Hof, Pim ; Kamiński, Marcin ; Paulusma, Daniël ; Szeider, Stefan ; Thilikos, Dimitrios M. On Graph Contractions and Induced MinorsArtikel Article2012
13Gaspers, Serge ; Sorkin, Gregory B. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in betweenArtikel Article2012
14Fellows, Michael R. ; Gaspers, Serge ; Rosamond, Frances A. Parameterizing by the Number of NumbersArtikel Article2012
15Alon, Noga ; Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders Solving MAX-r-SAT Above a Tight Lower BoundArtikel Article2011
16Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan Algorithms and Complexity Results for Persuasive ArgumentationArtikel Article2011
17Atserias, A. ; Fichte, J. K. ; Thurley, M. Clause-learning algorithms with many restarts and bounded-width resolutionArtikel Article2011
18Szeider, Stefan Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsArtikel Article2011
19Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders A Probabilistic Approach to Problems Parameterized Above or Below Tight BoundsArtikel Article2011
20Szeider, Stefan The Parameterized Complexity of k-Flip Local Search for SAT and MAX SATArtikel Article2011