Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Backdoor Treewidth for SAT.

[BibT_eX]

[DOI]

M. S. Ramanujan

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.

[BibT_eX]

[DOI]

Neha Lodha

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Circuit Treewidth, Sentential Decision, and Query Compilation.

[BibT_eX]

[DOI]

Simone Bova

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Backdoor Trees for Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, 2017

Backdoor Sets for CSP.

[BibT_eX]

[DOI]

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

M. S. Ramanujan

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Parameterized SAT.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Model Checking Existential Logic on Partially Ordered Sets.

[BibT_eX]

[DOI]

Simone Bova

ACM Trans. Comput. Log., 2016

Soundness of Q-resolution with dependency schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Quantified conjunctive queries on partially ordered sets.

[BibT_eX]

[DOI]

Simone Bova

Theor. Comput. Sci., 2016

Meta-kernelization with structural parameters.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Quantifier Reordering for QBF.

[BibT_eX]

[DOI]

J. Autom. Reason., 2016

Model Counting for CNF Formulas of Bounded Modular Treewidth.

[BibT_eX]

[DOI]

Daniël Paulusma

Algorithmica, 2016

Backdoors to q-Horn.

[BibT_eX]

[DOI]

Algorithmica, 2016

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Backdoors to Tractable Valued CSP.

[BibT_eX]

[DOI]

M. S. Ramanujan

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

A SAT Approach to Clique-Width.

[BibT_eX]

[DOI]

Marijn Heule

ACM Trans. Comput. Log., 2015

Backdoors to Normality for Disjunctive Logic Programs.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2015

Parameterized and subexponential-time complexity of satisfiability problems and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On finding optimal polytrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A complete parameterized complexity analysis of bounded planning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

On the Subexponential-Time Complexity of CSP.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions.

[BibT_eX]

[DOI]

CoRR, 2015

Guest Editorial: Special Issue on Parameterized and Exact Computation.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Algorithmica, 2015

Backdoors to tractable answer set programming.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Community Structure Inspired Algorithms for SAT and #SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation.

[BibT_eX]

[DOI]

Ulle Endriss

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Tractable answer-set programming with weight constraints: bounded treewidth is not enough.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2014

Guarantees and limits of preprocessing in constraint satisfaction and reasoning.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Variable Dependencies and Q-Resolution.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Fixed-Parameter Tractable Reductions to SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

The Parameterized Complexity of Reasoning Problems Beyond NP.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Small Unsatisfiable Subsets in Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Subexponential Time Complexity of CSP with Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Satisfiability of acyclic and almost acyclic CNF formulas.

[BibT_eX]

[DOI]

Daniël Paulusma

Theor. Comput. Sci., 2013

Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Parameterized Complexity Results for Exact Bayesian Network Structure Learning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2013

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Revisiting Space in Proof Complexity: Treewidth and Pathwidth.

[BibT_eX]

[DOI]

Moritz Müller

Electron. Colloquium Comput. Complex., 2013

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.

[BibT_eX]

[DOI]

Eun Jung Kim

Proceedings of the Theory and Applications of Formal Argumentation, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Local Backbones.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Model Counting for Formulas of Bounded Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Backdoors to Abduction.

[BibT_eX]

[DOI]

Andreas Pfandler

Stefan Rümmele

Proceedings of the IJCAI 2013, 2013

Capturing Structure in Hard Combinatorial Problems.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Strong Backdoors to Bounded Treewidth SAT.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

On the Subexponential Time Complexity of CSP.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Parameterized Complexity Results for Plan Reuse.

[BibT_eX]

[DOI]

Anna Roubícková

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Editing graphs to satisfy degree constraints: A parameterized approach.

[BibT_eX]

[DOI]

Luke Mathieson

J. Comput. Syst. Sci., 2012

On graph contractions and induced minors.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Discret. Appl. Math., 2012

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Eun Jung Kim

Arezou Soleimanfallah

Anders Yeo

Algorithmica, 2012

Augmenting tractable fragments of abstract argumentation.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Artif. Intell., 2012

Abstract Argumentation via Monadic Second Order Logic.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Stefan Woltran

Proceedings of the Scalable Uncertainty Management - 6th International Conference, 2012

Computing Resolution-Path Dependencies in Linear Time , .

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Strong Backdoors to Nested Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

k-Gap Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Backdoors to Acyclic SAT.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Backdoors to Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Don't Be Strict in Local Search!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Complexity of Planning Revisited - A Parameterized Analysis.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Monadic second order logic on graphs with local cardinality constraints.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2011

A probabilistic approach to problems parameterized above or below tight bounds.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

On the complexity of some colorful problems parameterized by treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2011

The Parameterized Complexity of Local Consistency.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

The parameterized complexity of k-flip local search for SAT and MAX SAT.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Not So Easy Problems for Tree Decomposable Graphs

[BibT_eX]

[DOI]

CoRR, 2011

Tractable cases of the extended global cardinality constraint.

[BibT_eX]

[DOI]

Constraints An Int. J., 2011

Parameterized Proof Complexity.

[BibT_eX]

[DOI]

Stefan S. Dantchev

Barnaby Martin

Comput. Complex., 2011

Solving MAX-r-SAT Above a Tight Lower Bound.

[BibT_eX]

[DOI]

Algorithmica, 2011

Algorithms and complexity results for persuasive argumentation.

[BibT_eX]

[DOI]

Eun Jung Kim

Artif. Intell., 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

The Parameterized Complexity of Constraint Satisfaction and Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Augmenting Tractable Fragments of Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Kernels for Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Limits of Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Algorithms for propositional model counting.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Editorial.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Constraint satisfaction with bounded treewidth revisited.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Algorithms and Complexity Results for Exact Bayesian Structure Learning.

[BibT_eX]

[DOI]

Proceedings of the UAI 2010, 2010

On Contracting Graphs to Fixed Pattern Graphs.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Solving MAX-r-SAT Above a Tight Lower Bound.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reasoning in Argumentation Frameworks of Bounded Clique-Width.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Stefan Woltran

Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

2009

Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Satisfiability, 2009

Covering graphs with few complete bipartite subgraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Clique-Width is NP-Complete.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Matched Formulas and Backdoor Sets.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2009

Backdoor Sets of Quantified Boolean Formulas.

[BibT_eX]

[DOI]

J. Autom. Reason., 2009

Solving MAX-2-SAT Above a Tight Lower Bound

[BibT_eX]

[DOI]

CoRR, 2009

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound

[BibT_eX]

[DOI]

CoRR, 2009

2008

Parameterized SAT.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Preface.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems.

[BibT_eX]

[DOI]

Georg Gottlob

Comput. J., 2008

Fixed-Parameter Complexity of Minimum Profile Problems.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Anders Yeo

Algorithmica, 2008

Parameterized Graph Editing with Chosen Vertex Degrees.

[BibT_eX]

[DOI]

Luke Mathieson

Proceedings of the Combinatorial Optimization and Applications, 2008

The Parameterized Complexity of Regular Subgraph Problems and Generalizations.

[BibT_eX]

[DOI]

Luke Mathieson

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

Backdoor Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

The Linear Arrangement Problem Parameterized Above Guaranteed Value.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.

[BibT_eX]

[DOI]

Stefan S. Dantchev

Barnaby Martin

Electron. Colloquium Comput. Complex., 2007

Solving #SAT using vertex covers.

[BibT_eX]

[DOI]

Naomi Nishimura

Prabhakar Ragde

Acta Informatica, 2007

2006

On finding short resolution refutations and small unsatisfiable subsets.

[BibT_eX]

[DOI]

Michael R. Fellows

Graham Wrightson

Theor. Comput. Sci., 2006

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.

[BibT_eX]

[DOI]

Shlomo Hoory

SIAM J. Discret. Math., 2006

A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth

[BibT_eX]

[DOI]

CoRR, 2006

Complexity and Applications of Edge-Induced Vertex-Cuts

[BibT_eX]

[DOI]

CoRR, 2006

Clique-width minimization is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

Computing unsatisfiable k-SAT instances with few occurrences per variable.

[BibT_eX]

[DOI]

Shlomo Hoory

Theor. Comput. Sci., 2005

The Complexity of Resolution with Generalized Symmetry Rules.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Backdoor Sets for DLL Subsolvers.

[BibT_eX]

[DOI]

J. Autom. Reason., 2005

On Edge-Colored Graphs Covered by Properly Colored Cycles.

[BibT_eX]

[DOI]

Herbert Fleischner

Graphs Comb., 2005

Proving NP-hardness for clique-width II: non-approximability of clique-width

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Generalizations of matched CNF formulas.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2005

2004

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors.

[BibT_eX]

Ars Comb., 2004

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

[BibT_eX]

[DOI]

Naomi Nishimura

Prabhakar Ragde

Proceedings of the SAT 2004, 2004

2003

Homomorphisms of conjunctive normal forms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Finding paths in graphs avoiding forbidden transitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On Fixed-Parameter Tractable Parameterizations of SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.

[BibT_eX]

[DOI]

Herbert Fleischner

Oliver Kullmann

Theor. Comput. Sci., 2002

2001

NP-Completeness of Refutability by Literal-Once Resolution.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference

[BibT_eX]

[DOI]

Herbert Fleischner