| Publication | Date of Publication | Type |
|---|
| IPASIR-up: user propagators for CDCL | 2024-11-26 | Paper |
| A SAT solver's opinion on the Erdős-Faber-Lovász conjecture | 2024-11-26 | Paper |
| SAT-based generation of panar graphs | 2024-11-26 | Paper |
SAT modulo symmetries for graph generation and enumeration
ACM Transactions on Computational Logic | 2024-09-25 | Paper |
SAT-boosted tabu search for coloring massive graphs
ACM Journal of Experimental Algorithmics | 2024-07-26 | Paper |
| A SAT attack on Rota's basis conjecture | 2024-07-12 | Paper |
| Weighted model counting with twin-width | 2024-07-12 | Paper |
Backdoor DNFs
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| A SAT approach to twin-width | 2024-05-24 | Paper |
SAT backdoors: depth beats size
Journal of Computer and System Sciences | 2024-03-11 | Paper |
CSP beyond tractable constraint languages
Constraints | 2024-02-14 | Paper |
Computing optimal hypertree decompositions with SAT
Artificial Intelligence | 2023-12-14 | Paper |
Are hitting formulas hard for resolution?
Discrete Applied Mathematics | 2023-06-15 | Paper |
On the parameterized complexity of clustering problems for incomplete data
Journal of Computer and System Sciences | 2023-03-10 | Paper |
Algorithmic applications of tree-cut width
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Threshold Treewidth and Hypertree Width
Journal of Artificial Intelligence Research | 2022-08-30 | Paper |
Sum-of-Products with Default Values: Algorithms and Complexity Results
Journal of Artificial Intelligence Research | 2022-05-16 | Paper |
Certified DQBF solving by definition extraction
(available as arXiv preprint) | 2022-03-22 | Paper |
On existential MSO and its relation to ETH
ACM Transactions on Computation Theory | 2022-03-07 | Paper |
New width parameters for SAT and \#SAT
Artificial Intelligence | 2021-11-02 | Paper |
| A SAT Approach to Twin-Width | 2021-10-12 | Paper |
Finding the hardest formulas for resolution
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
| Backdoor sets for CSP | 2021-06-15 | Paper |
| Short Q-resolution proofs with homomorphisms | 2021-04-07 | Paper |
| A faster algorithm for propositional model counting parameterized by incidence treewidth | 2021-04-07 | Paper |
Computing Optimal Hypertree Decompositions
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Formalizing graph trail properties in Isabelle/HOL
Lecture Notes in Computer Science | 2021-01-20 | Paper |
| Proof complexity of fragments of long-distance Q-resolution | 2020-05-20 | Paper |
| Combining resolution-path dependencies with dependency learning | 2020-05-20 | Paper |
A SAT approach to branchwidth
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
SAT-encodings for treecut width and treedepth
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Dependency Learning for QBF
Journal of Artificial Intelligence Research | 2019-07-12 | Paper |
Long-distance Q-resolution with dependency schemes
Journal of Automated Reasoning | 2019-05-31 | Paper |
On the parameterized complexity of \((k,s)\)-SAT
Information Processing Letters | 2019-01-18 | Paper |
Discovering archipelagos of tractability for constraint satisfaction and counting
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Meta-kernelization using well-structured modulators
Discrete Applied Mathematics | 2018-09-17 | Paper |
Meta-kernelization using well-structured modulators
Discrete Applied Mathematics | 2018-09-17 | Paper |
| Polynomial-time validation of QCDCL certificates | 2018-08-10 | Paper |
Discovering archipelagos of tractability for constraint satisfaction and counting
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
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) | 2018-04-23 | Paper |
Combining treewidth and backdoors for CSP
(available as arXiv preprint) | 2018-04-19 | Paper |
Solving problems on graphs of high rank-width
Algorithmica | 2018-04-06 | Paper |
| On existential MSO and its relation to ETH | 2018-03-21 | Paper |
| Dependency learning for QBF | 2017-11-15 | Paper |
| Backdoor treewidth for SAT | 2017-11-15 | Paper |
| New width parameters for model counting | 2017-11-15 | Paper |
| SAT-based local improvement for finding tree decompositions of small width | 2017-11-15 | Paper |
| SAT-encodings for special treewidth and pathwidth | 2017-11-15 | Paper |
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
| Meta-kernelization using Well-structured Modulators | 2017-09-29 | Paper |
The treewidth of proofs
Information and Computation | 2017-08-08 | Paper |
Model checking existential logic on partially ordered sets
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Backdoors to normality for disjunctive logic programs
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Parameterized complexity classes beyond para-NP
Journal of Computer and System Sciences | 2017-05-24 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
| Model counting for CNF formulas of bounded modular treewidth | 2017-01-30 | Paper |
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Model counting for CNF formulas of bounded modular treewidth
Algorithmica | 2016-11-01 | Paper |
Long distance Q-resolution with dependency schemes
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
A SAT approach to branchwidth
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Quantifier reordering for QBF
Journal of Automated Reasoning | 2016-05-26 | Paper |
Backdoors to q-Horn
Algorithmica | 2016-03-23 | Paper |
Quantified conjunctive queries on partially ordered sets
Theoretical Computer Science | 2016-02-18 | Paper |
Soundness of \(\mathcal{Q}\)-resolution with dependency schemes
Theoretical Computer Science | 2015-12-15 | Paper |
Parameterized and subexponential-time complexity of satisfiability problems and applications
Theoretical Computer Science | 2015-12-11 | Paper |
Meta-kernelization with structural parameters
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Community structure inspired algorithms for SAT and \#SAT
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Solving problems on graphs of high rank-width
Lecture Notes in Computer Science | 2015-10-30 | Paper |
On finding optimal polytrees
Theoretical Computer Science | 2015-10-08 | Paper |
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A SAT approach to clique-width
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Algorithmic applications of tree-cut width
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Quantified conjunctive queries on partially ordered sets
Parameterized and Exact Computation | 2015-09-15 | Paper |
Parameterized and subexponential-time complexity of satisfiability problems and applications
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
A complete parameterized complexity analysis of bounded planning
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Backdoors to tractable answer set programming
Artificial Intelligence | 2015-05-06 | Paper |
On the subexponential-time complexity of CSP
Journal of Artificial Intelligence Research | 2015-03-04 | Paper |
Machine characterizations for parameterized complexity classes beyond para-NP
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Artificial Intelligence | 2014-10-13 | Paper |
Fixed-parameter tractable reductions to SAT
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Variable dependencies and Q-resolution
Lecture Notes in Computer Science | 2014-09-26 | Paper |
| scientific article; zbMATH DE number 6297727 (Why is no real title available?) | 2014-05-22 | Paper |
Tractable answer-set programming with weight constraints: bounded treewidth is not enough
Theory and Practice of Logic Programming | 2014-04-17 | Paper |
The complexity of repairing, adjusting, and aggregating of extensions in abstract argumentation
Theory and Applications of Formal Argumentation | 2014-03-31 | Paper |
Model counting for formulas of bounded clique-width
Algorithms and Computation | 2014-01-14 | Paper |
Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value
Theory of Computing Systems | 2013-12-02 | Paper |
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science | 2013-11-29 | Paper |
Revisiting space in proof complexity: treewidth and pathwidth
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Meta-kernelization with structural parameters
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Computing Resolution-Path Dependencies in Linear Time ,
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Backdoors to acyclic SAT
Automata, Languages, and Programming | 2013-08-12 | Paper |
Strong backdoors to nested satisfiability
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Upper and lower bounds for weak backdoor set detection
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
A SAT approach to clique-width
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Local backbones
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Parameterized complexity and kernel bounds for hard planning problems
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Parameterized complexity results for exact Bayesian network structure learning
Journal of Artificial Intelligence Research | 2013-04-09 | Paper |
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming
Algorithmica | 2012-11-21 | Paper |
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence | 2012-11-15 | Paper |
The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
Discrete Optimization | 2012-10-16 | Paper |
Parameterized proof complexity
Computational Complexity | 2012-09-21 | Paper |
Backdoors to satisfaction
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
| Satisfiability of acyclic and almost acyclic CNF formulas | 2012-08-29 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Editing graphs to satisfy degree constraints: a parameterized approach
Journal of Computer and System Sciences | 2012-05-11 | Paper |
On graph contractions and induced minors
Discrete Applied Mathematics | 2012-05-11 | Paper |
| Strong Backdoors to Bounded Treewidth SAT | 2012-04-27 | Paper |
Algorithms and complexity results for persuasive argumentation
Artificial Intelligence | 2011-11-17 | Paper |
Solving MAX-\(r\)-SAT above a tight lower bound
Algorithmica | 2011-11-07 | Paper |
scientific article; zbMATH DE number 5917571 (Why is no real title available?)
(available as arXiv preprint) | 2011-07-06 | Paper |
Satisfiability of acyclic and almost acyclic CNF formulas. II
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Tractable cases of the extended global cardinality constraint
Constraints | 2011-04-06 | Paper |
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences | 2011-03-28 | Paper |
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Lecture Notes in Computer Science | 2011-03-18 | Paper |
On the complexity of some colorful problems parameterized by treewidth
Information and Computation | 2011-02-21 | Paper |
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming
Lecture Notes in Computer Science | 2010-12-07 | Paper |
Clique-width is NP-complete
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Algorithms for propositional model counting
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences | 2010-02-12 | Paper |
On contracting graphs to fixed pattern graphs
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
A probabilistic approach to problems parameterized above or below tight bounds
Parameterized and Exact Computation | 2010-01-14 | Paper |
Backdoor sets of quantified Boolean formulas
Journal of Automated Reasoning | 2009-11-25 | Paper |
| Matched formulas and backdoor sets | 2009-10-12 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science | 2009-05-28 | Paper |
Backdoor Sets of Quantified Boolean Formulas
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Matched Formulas and Backdoor Sets
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Parameterized Graph Editing with Chosen Vertex Degrees
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Fixed-parameter complexity of minimum profile problems
Algorithmica | 2008-12-02 | Paper |
Constraint Satisfaction with Bounded Treewidth Revisited
Principles and Practice of Constraint Programming - CP 2006 | 2008-09-09 | Paper |
Fixed-Parameter Complexity of Minimum Profile Problems
Parameterized and Exact Computation | 2008-06-03 | Paper |
Algorithms for Propositional Model Counting
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Covering Graphs with Few Complete Bipartite Subgraphs
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
The linear arrangement problem parameterized above guaranteed value
Theory of Computing Systems | 2007-12-19 | Paper |
Solving \#SAT using vertex covers
Acta Informatica | 2007-12-10 | Paper |
Solving #SAT Using Vertex Covers
Lecture Notes in Computer Science | 2007-09-04 | Paper |
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Backdoor sets for DLL subsolvers
Journal of Automated Reasoning | 2007-01-24 | Paper |
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science | 2006-04-06 | Paper |
On edge-colored graphs covered by properly colored cycles
Graphs and Combinatorics | 2005-11-24 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2192138 (Why is no real title available?) | 2005-08-04 | Paper |
Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
Theoretical Computer Science | 2005-06-30 | Paper |
Generalizations of matched CNF formulas
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
The complexity of resolution with generalized symmetry rules
Theory of Computing Systems | 2005-04-19 | Paper |
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Homomorphisms of conjunctive normal forms.
Discrete Applied Mathematics | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1962837 (Why is no real title available?) | 2003-08-11 | Paper |
Finding paths in graphs avoiding forbidden transitions
Discrete Applied Mathematics | 2003-03-09 | Paper |
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1765669 (Why is no real title available?) | 2002-07-10 | Paper |
