| Publication | Date of Publication | Type |
|---|
| SAT backdoors: depth beats size | 2024-03-11 | Paper |
| CSP beyond tractable constraint languages | 2024-02-14 | Paper |
| Computing optimal hypertree decompositions with SAT | 2023-12-14 | Paper |
| Are hitting formulas hard for resolution? | 2023-06-15 | Paper |
| On the parameterized complexity of clustering problems for incomplete data | 2023-03-10 | Paper |
| Algorithmic Applications of Tree-Cut Width | 2022-11-15 | Paper |
| Threshold Treewidth and Hypertree Width | 2022-08-30 | Paper |
| Sum-of-Products with Default Values: Algorithms and Complexity Results | 2022-05-16 | Paper |
| Certified DQBF solving by definition extraction | 2022-03-22 | Paper |
| On Existential MSO and Its Relation to ETH | 2022-03-07 | Paper |
| New width parameters for SAT and \#SAT | 2021-11-02 | Paper |
| Finding the Hardest Formulas for Resolution | 2021-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993598 | 2021-06-15 | Paper |
| A faster algorithm for propositional model counting parameterized by incidence treewidth | 2021-04-07 | Paper |
| Short Q-resolution proofs with homomorphisms | 2021-04-07 | Paper |
| Computing Optimal Hypertree Decompositions | 2021-01-27 | Paper |
| Induction with generalization in superposition reasoning | 2021-01-20 | Paper |
| Combining resolution-path dependencies with dependency learning | 2020-05-20 | Paper |
| Proof complexity of fragments of long-distance Q-resolution | 2020-05-20 | Paper |
| A SAT Approach to Branchwidth | 2019-11-22 | Paper |
| SAT-Encodings for Treecut Width and Treedepth | 2019-09-13 | Paper |
| Dependency Learning for QBF | 2019-07-12 | Paper |
| Long-distance Q-resolution with dependency schemes | 2019-05-31 | Paper |
| On the parameterized complexity of \((k,s)\)-SAT | 2019-01-18 | Paper |
| Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting | 2018-11-05 | Paper |
| Meta-kernelization using well-structured modulators | 2018-09-17 | Paper |
| Polynomial-time validation of QCDCL certificates | 2018-08-10 | Paper |
| Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting | 2018-07-16 | Paper |
| Model checking existential logic on partially ordered sets | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636635 | 2018-04-19 | Paper |
| Solving problems on graphs of high rank-width | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608603 | 2018-03-21 | Paper |
| Backdoor treewidth for SAT | 2017-11-15 | Paper |
| New width parameters for model counting | 2017-11-15 | Paper |
| Dependency learning for QBF | 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 | 2017-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363765 | 2017-09-29 | Paper |
| The treewidth of proofs | 2017-08-08 | Paper |
| Model checking existential logic on partially ordered sets | 2017-07-12 | Paper |
| Backdoors to Normality for Disjunctive Logic Programs | 2017-07-12 | Paper |
| Parameterized complexity classes beyond para-NP | 2017-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957871 | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957872 | 2017-01-30 | Paper |
| Backdoors into heterogeneous classes of SAT and CSP | 2016-12-28 | Paper |
| Model counting for CNF formulas of bounded modular treewidth | 2016-11-01 | Paper |
| A SAT Approach to Branchwidth | 2016-09-05 | Paper |
| Long Distance Q-Resolution with Dependency Schemes | 2016-09-05 | Paper |
| Quantifier reordering for QBF | 2016-05-26 | Paper |
| Backdoors to q-Horn | 2016-03-23 | Paper |
| Quantified conjunctive queries on partially ordered sets | 2016-02-18 | Paper |
| Soundness of \(\mathcal{Q}\)-resolution with dependency schemes | 2015-12-15 | Paper |
| Meta-kernelization with structural parameters | 2015-12-11 | Paper |
| Parameterized and subexponential-time complexity of satisfiability problems and applications | 2015-12-11 | Paper |
| Community Structure Inspired Algorithms for SAT and #SAT | 2015-11-20 | Paper |
| Solving Problems on Graphs of High Rank-Width | 2015-10-30 | Paper |
| On finding optimal polytrees | 2015-10-08 | Paper |
| Monadic second order logic on graphs with local cardinality constraints | 2015-09-17 | Paper |
| A SAT Approach to Clique-Width | 2015-09-17 | Paper |
| Algorithmic Applications of Tree-Cut Width | 2015-09-16 | Paper |
| Quantified Conjunctive Queries on Partially Ordered Sets | 2015-09-15 | Paper |
| Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications | 2015-09-11 | Paper |
| A complete parameterized complexity analysis of bounded planning | 2015-07-13 | Paper |
| Backdoors to tractable answer set programming | 2015-05-06 | Paper |
| On the Subexponential-Time Complexity of CSP | 2015-03-04 | Paper |
| Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP | 2015-02-20 | Paper |
| Clique-width minimization is NP-hard | 2014-11-25 | Paper |
| Guarantees and limits of preprocessing in constraint satisfaction and reasoning | 2014-10-13 | Paper |
| Fixed-Parameter Tractable Reductions to SAT | 2014-09-26 | Paper |
| Variable Dependencies and Q-Resolution | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417644 | 2014-05-22 | Paper |
| Tractable answer-set programming with weight constraints: bounded treewidth is not enough | 2014-04-17 | Paper |
| The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation | 2014-03-31 | Paper |
| Model Counting for Formulas of Bounded Clique-Width | 2014-01-14 | Paper |
| Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value | 2013-12-02 | Paper |
| Satisfiability of acyclic and almost acyclic CNF formulas | 2013-11-29 | Paper |
| Meta-kernelization with Structural Parameters | 2013-09-20 | Paper |
| Revisiting Space in Proof Complexity: Treewidth and Pathwidth | 2013-09-20 | Paper |
| Backdoors to Acyclic SAT | 2013-08-12 | Paper |
| Computing Resolution-Path Dependencies in Linear Time , | 2013-08-12 | Paper |
| Strong Backdoors to Nested Satisfiability | 2013-08-12 | Paper |
| Local Backbones | 2013-08-05 | Paper |
| Upper and Lower Bounds for Weak Backdoor Set Detection | 2013-08-05 | Paper |
| A SAT Approach to Clique-Width | 2013-08-05 | Paper |
| Parameterized Complexity and Kernel Bounds for Hard Planning Problems | 2013-06-07 | Paper |
| Parameterized Complexity Results for Exact Bayesian Network Structure Learning | 2013-04-09 | Paper |
| Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming | 2012-11-21 | Paper |
| Augmenting tractable fragments of abstract argumentation | 2012-11-15 | Paper |
| The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT | 2012-10-16 | Paper |
| Parameterized proof complexity | 2012-09-21 | Paper |
| Backdoors to Satisfaction | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908839 | 2012-08-29 | Paper |
| k-Gap Interval Graphs | 2012-06-29 | Paper |
| Editing graphs to satisfy degree constraints: a parameterized approach | 2012-05-11 | Paper |
| On graph contractions and induced minors | 2012-05-11 | Paper |
| Strong Backdoors to Bounded Treewidth SAT | 2012-04-27 | Paper |
| Algorithms and complexity results for persuasive argumentation | 2011-11-17 | Paper |
| Solving MAX-\(r\)-SAT above a tight lower bound | 2011-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012402 | 2011-07-06 | Paper |
| Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) | 2011-06-17 | Paper |
| Tractable cases of the extended global cardinality constraint | 2011-04-06 | Paper |
| A probabilistic approach to problems parameterized above or below tight bounds | 2011-03-28 | Paper |
| Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable | 2011-03-18 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming | 2010-12-07 | Paper |
| Clique-Width is NP-Complete | 2010-06-01 | Paper |
| Algorithms for propositional model counting | 2010-02-26 | Paper |
| Constraint satisfaction with bounded treewidth revisited | 2010-02-12 | Paper |
| On Contracting Graphs to Fixed Pattern Graphs | 2010-01-28 | Paper |
| A Probabilistic Approach to Problems Parameterized above or below Tight Bounds | 2010-01-14 | Paper |
| Backdoor sets of quantified Boolean formulas | 2009-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181640 | 2009-10-12 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT | 2009-07-07 | Paper |
| Covering graphs with few complete bipartite subgraphs | 2009-05-28 | Paper |
| Matched Formulas and Backdoor Sets | 2009-03-10 | Paper |
| Backdoor Sets of Quantified Boolean Formulas | 2009-03-10 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Monadic Second Order Logic on Graphs with Local Cardinality Constraints | 2009-02-03 | Paper |
| Parameterized Graph Editing with Chosen Vertex Degrees | 2009-01-27 | Paper |
| Fixed-parameter complexity of minimum profile problems | 2008-12-02 | Paper |
| Constraint Satisfaction with Bounded Treewidth Revisited | 2008-09-09 | Paper |
| Fixed-Parameter Complexity of Minimum Profile Problems | 2008-06-03 | Paper |
| Algorithms for Propositional Model Counting | 2008-05-15 | Paper |
| Covering Graphs with Few Complete Bipartite Subgraphs | 2008-04-24 | Paper |
| The linear arrangement problem parameterized above guaranteed value | 2007-12-19 | Paper |
| Solving \#SAT using vertex covers | 2007-12-10 | Paper |
| Solving #SAT Using Vertex Covers | 2007-09-04 | Paper |
| A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable | 2007-05-22 | Paper |
| The Linear Arrangement Problem Parameterized Above Guaranteed Value | 2007-05-02 | Paper |
| Backdoor sets for DLL subsolvers | 2007-01-24 | Paper |
| On finding short resolution refutations and small unsatisfiable subsets | 2006-04-06 | Paper |
| On edge-colored graphs covered by properly colored cycles | 2005-11-24 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463512 | 2005-08-04 | Paper |
| Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable | 2005-06-30 | Paper |
| Generalizations of matched CNF formulas | 2005-05-13 | Paper |
| The complexity of resolution with generalized symmetry rules | 2005-04-19 | Paper |
| Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable | 2005-02-23 | Paper |
| Homomorphisms of conjunctive normal forms. | 2003-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418674 | 2003-08-11 | Paper |
| Finding paths in graphs avoiding forbidden transitions | 2003-03-09 | Paper |
| Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539605 | 2002-07-10 | Paper |
