Stefan Szeider

According to our database1, Stefan Szeider
  • authored at least 222 papers between 2000 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.
ACM Trans. Comput. Log., 2017

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
ACM Trans. Algorithms, 2017

Parameterized complexity classes beyond para-NP.
J. Comput. Syst. Sci., 2017

Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci., 2017

The treewidth of proofs.
Inf. Comput., 2017

Circuit Treewidth, Sentential Decision, and Query Compilation.
CoRR, 2017

Combining Treewidth and Backdoors for CSP.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

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

SAT-Encodings for Special Treewidth and Pathwidth.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

New Width Parameters for Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Backdoor Treewidth for SAT.
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.
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.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Backdoor Trees for Answer Set Programming.
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

A SAT Approach to Branchwidth.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Backdoor Sets for CSP.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Parameterized SAT.
Encyclopedia of Algorithms, 2016

Model Checking Existential Logic on Partially Ordered Sets.
ACM Trans. Comput. Log., 2016

Soundness of Q-resolution with dependency schemes.
Theor. Comput. Sci., 2016

Quantified conjunctive queries on partially ordered sets.
Theor. Comput. Sci., 2016

Meta-kernelization with structural parameters.
J. Comput. Syst. Sci., 2016

Quantifier Reordering for QBF.
J. Autom. Reasoning, 2016

Backdoors to Tractable Valued CSP.
CoRR, 2016

Combining Treewidth and Backdoors for CSP.
CoRR, 2016

Model Counting for CNF Formulas of Bounded Modular Treewidth.
Algorithmica, 2016

Backdoors to q-Horn.
Algorithmica, 2016

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Long Distance Q-Resolution with Dependency Schemes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

A SAT Approach to Branchwidth.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

On Existential MSO and its Relation to ETH.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.
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.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Backdoors to Tractable Valued CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
A SAT Approach to Clique-Width.
ACM Trans. Comput. Log., 2015

Backdoors to Normality for Disjunctive Logic Programs.
ACM Trans. Comput. Log., 2015

Parameterized and subexponential-time complexity of satisfiability problems and applications.
Theor. Comput. Sci., 2015

On finding optimal polytrees.
Theor. Comput. Sci., 2015

A complete parameterized complexity analysis of bounded planning.
J. Comput. Syst. Sci., 2015

On the Subexponential-Time Complexity of CSP.
J. Artif. Intell. Res., 2015

Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR, 2015

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
CoRR, 2015

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

Meta-Kernelization using Well-Structured Modulators.
CoRR, 2015

Solving Problems on Graphs of High Rank-Width.
CoRR, 2015

Guest Editorial: Special Issue on Parameterized and Exact Computation.
Algorithmica, 2015

Backdoors to tractable answer set programming.
Artif. Intell., 2015

Solving Problems on Graphs of High Rank-Width.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Community Structure Inspired Algorithms for SAT and #SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Algorithmic Applications of Tree-Cut Width.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Meta-kernelization using Well-structured Modulators.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation.
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.
TPLP, 2014

Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Model Counting for Formulas of Bounded Clique-Width.
CoRR, 2014

Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
CoRR, 2014

Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning.
CoRR, 2014

Quantified Conjunctive Queries on Partially Ordered Sets.
CoRR, 2014

Model Checking Existential Logic on Partially Ordered Sets.
CoRR, 2014

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

Guarantees and limits of preprocessing in constraint satisfaction and reasoning.
Artif. Intell., 2014

Variable Dependencies and Q-Resolution.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Fixed-Parameter Tractable Reductions to SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

The Parameterized Complexity of Reasoning Problems Beyond NP.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Quantified Conjunctive Queries on Partially Ordered Sets.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Small Unsatisfiable Subsets in Constraint Satisfaction.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Model checking existential logic on partially ordered sets.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Subexponential Time Complexity of CSP with Global Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications.
Proceedings of the Combinatorial Optimization and Applications, 2014

Backdoors into Heterogeneous Classes of SAT and CSP.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Satisfiability of acyclic and almost acyclic CNF formulas.
Theor. Comput. Sci., 2013

Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst., 2013

Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
J. Artif. Intell. Res., 2013

Preface.
Fundam. Inform., 2013

Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Backdoors to Abduction
CoRR, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection
CoRR, 2013

A SAT Approach to Clique-Width
CoRR, 2013

Local Backbones
CoRR, 2013

On the Subexponential Time Complexity of CSP
CoRR, 2013

Meta-Kernelization with Structural Parameters
CoRR, 2013

Backdoors to Normality for Disjunctive Logic Programs
CoRR, 2013

The Parameterized Complexity of Reasoning Problems Beyond NP.
CoRR, 2013

Parameterized Complexity Results for Plan Reuse.
CoRR, 2013

A Complete Parameterized Complexity Analysis of Bounded Planning.
CoRR, 2013

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.
Proceedings of the Theory and Applications of Formal Argumentation, 2013

Model Counting for CNF Formulas of Bounded Modular Treewidth.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Backdoors to q-Horn.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

A SAT Approach to Clique-Width.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

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

Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Meta-kernelization with Structural Parameters.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Model Counting for Formulas of Bounded Clique-Width.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Backdoors to Abduction.
Proceedings of the IJCAI 2013, 2013

Capturing Structure in Hard Combinatorial Problems.
Proceedings of the 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 2013

Strong Backdoors to Bounded Treewidth SAT.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Parameterized Complexity and Kernel Bounds for Hard Planning Problems.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

On the Subexponential Time Complexity of CSP.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Parameterized Complexity Results for Plan Reuse.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Backdoors to Normality for Disjunctive Logic Programs.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Editing graphs to satisfy degree constraints: A parameterized approach.
J. Comput. Syst. Sci., 2012

On graph contractions and induced minors.
Discrete Applied Mathematics, 2012

Parameterized Complexity and Kernel Bounds for Hard Planning Problems
CoRR, 2012

The Complexity of Planning Revisited - A Parameterized Analysis
CoRR, 2012

On Finding Optimal Polytrees
CoRR, 2012

Don't Be Strict in Local Search!
CoRR, 2012

Strong Backdoors to Bounded Treewidth SAT
CoRR, 2012

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
CoRR, 2012

Algorithms and Complexity Results for Exact Bayesian Structure Learning
CoRR, 2012

Strong Backdoors to Nested Satisfiability
CoRR, 2012

Computing Resolution-Path Dependencies in Linear Time
CoRR, 2012

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

Augmenting tractable fragments of abstract argumentation.
Artif. Intell., 2012

Abstract Argumentation via Monadic Second Order Logic.
Proceedings of the Scalable Uncertainty Management - 6th International Conference, 2012

Computing Resolution-Path Dependencies in Linear Time , .
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Strong Backdoors to Nested Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Backdoors to Acyclic SAT.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Backdoors to Satisfaction.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Don't Be Strict in Local Search!
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

On Finding Optimal Polytrees.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Complexity of Planning Revisited - A Parameterized Analysis.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Monadic second order logic on graphs with local cardinality constraints.
ACM Trans. Comput. Log., 2011

A probabilistic approach to problems parameterized above or below tight bounds.
J. Comput. Syst. Sci., 2011

On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput., 2011

The Parameterized Complexity of Local Consistency.
Electronic Colloquium on Computational Complexity (ECCC), 2011

The parameterized complexity of k-flip local search for SAT and MAX SAT.
Discrete Optimization, 2011

k-Gap Interval Graphs
CoRR, 2011

Backdoors to Satisfaction
CoRR, 2011

Backdoors to Acyclic SAT
CoRR, 2011

Not So Easy Problems for Tree Decomposable Graphs
CoRR, 2011

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
CoRR, 2011

Limits of Preprocessing
CoRR, 2011

Algorithms and Complexity Results for Persuasive Argumentation
CoRR, 2011

Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)
CoRR, 2011

Augmenting Tractable Fragments of Abstract Argumentation
CoRR, 2011

Backdoors to Tractable Answer-Set Programming
CoRR, 2011

Kernels for Global Constraints
CoRR, 2011

Tractable cases of the extended global cardinality constraint.
Constraints, 2011

Parameterized Proof Complexity.
Computational Complexity, 2011

Solving MAX-r-SAT Above a Tight Lower Bound.
Algorithmica, 2011

Algorithms and complexity results for persuasive argumentation.
Artif. Intell., 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

The Parameterized Complexity of Constraint Satisfaction and Reasoning.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Augmenting Tractable Fragments of Abstract Argumentation.
Proceedings of the IJCAI 2011, 2011

Kernels for Global Constraints.
Proceedings of the IJCAI 2011, 2011

Backdoors to Tractable Answer-Set Programming.
Proceedings of the IJCAI 2011, 2011

The Parameterized Complexity of Local Consistency.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

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

2010
Algorithms for propositional model counting.
J. Discrete Algorithms, 2010

Editorial.
J. Discrete Algorithms, 2010

Constraint satisfaction with bounded treewidth revisited.
J. Comput. Syst. Sci., 2010

Algorithms and Complexity Results for Exact Bayesian Structure Learning.
Proceedings of the UAI 2010, 2010

On Contracting Graphs to Fixed Pattern Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Solving MAX-r-SAT Above a Tight Lower Bound.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Satisfiability of Acyclic and Almost Acyclic CNF Formulas.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Algorithms and Complexity Results for Persuasive Argumentation.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

Reasoning in Argumentation Frameworks of Bounded Clique-Width.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

2009
Fixed-Parameter Tractability.
Proceedings of the Handbook of Satisfiability, 2009

Covering graphs with few complete bipartite subgraphs.
Theor. Comput. Sci., 2009

Clique-Width is NP-Complete.
SIAM J. Discrete Math., 2009

Matched Formulas and Backdoor Sets.
JSAT, 2009

Editorial.
J. Discrete Algorithms, 2009

Backdoor Sets of Quantified Boolean Formulas.
J. Autom. Reasoning, 2009

Solving MAX-2-SAT Above a Tight Lower Bound
CoRR, 2009

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
CoRR, 2009

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

A Probabilistic Approach to Problems Parameterized above or below Tight Bounds.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008
Parameterized SAT.
Proceedings of the Encyclopedia of Algorithms, 2008

Preface.
J. Discrete Algorithms, 2008

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

Fixed-Parameter Complexity of Minimum Profile Problems.
Algorithmica, 2008

Monadic Second Order Logic on Graphs with Local Cardinality Constraints.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Parameterized Graph Editing with Chosen Vertex Degrees.
Proceedings of the Combinatorial Optimization and Applications, 2008

Tractable Cases of the Extended Global Cardinality Constraint.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

The Parameterized Complexity of Regular Subgraph Problems and Generalizations.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

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

2007
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst., 2007

Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.
Electronic Colloquium on Computational Complexity (ECCC), 2007

Solving #SAT using vertex covers.
Acta Inf., 2007

Matched Formulas and Backdoor Sets.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Backdoor Sets of Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Algorithms for Propositional Model Counting.
Proceedings of the Logic for Programming, 2007

Covering Graphs with Few Complete Bipartite Subgraphs.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Parameterized Proof Complexity.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

On the Complexity of Some Colorful Problems Parameterized by Treewidth.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
On finding short resolution refutations and small unsatisfiable subsets.
Theor. Comput. Sci., 2006

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.
SIAM J. Discrete Math., 2006

A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
CoRR, 2006

Complexity and Applications of Edge-Induced Vertex-Cuts
CoRR, 2006

Fixed-Parameter Complexity of Minimum Profile Problems
CoRR, 2006

Clique-width minimization is NP-hard.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Solving #SAT Using Vertex Covers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Fixed-Parameter Complexity of Minimum Profile Problems.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Constraint Satisfaction with Bounded Treewidth Revisited.
Proceedings of the Principles and Practice of Constraint Programming, 2006

The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
Computing unsatisfiable k-SAT instances with few occurrences per variable.
Theor. Comput. Sci., 2005

The Complexity of Resolution with Generalized Symmetry Rules.
Theory Comput. Syst., 2005

Backdoor Sets for DLL Subsolvers.
J. Autom. Reasoning, 2005

On Edge-Colored Graphs Covered by Properly Colored Cycles.
Graphs and Combinatorics, 2005

Proving NP-hardness for clique-width II: non-approximability of clique-width
Electronic Colloquium on Computational Complexity (ECCC), 2005

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electronic Colloquium on Computational Complexity (ECCC), 2005

The Linear Arrangement Problem Parameterized Above Guaranteed Value
CoRR, 2005

Generalizations of matched CNF formulas.
Ann. Math. Artif. Intell., 2005

2004
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.
J. Comput. Syst. Sci., 2004

On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors.
Ars Comb., 2004

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
Proceedings of the SAT 2004, 2004

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.
Proceedings of the SAT 2004, 2004

On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Electronic Colloquium on Computational Complexity (ECCC), 2003

Homomorphisms of conjunctive normal forms.
Discrete Applied Mathematics, 2003

Finding paths in graphs avoiding forbidden transitions.
Discrete Applied Mathematics, 2003

The Complexity of Resolution with Generalized Symmetry Rules.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

On Fixed-Parameter Tractable Parameterizations of SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theor. Comput. Sci., 2002

2001
NP-Completeness of Refutability by Literal-Once Resolution.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
Electronic Colloquium on Computational Complexity (ECCC), 2000


  Loading...