| Publication | Date of Publication | Type |
|---|
| Complexity classification transfer for CSPs via algebraic products | 2024-10-21 | Paper |
| Almost consistent systems of linear equations | 2024-05-14 | Paper |
| Solving infinite-domain CSPs using the patchwork property | 2023-06-19 | Paper |
| General lower bounds and improved algorithms for infinite-domain CSPs | 2023-04-21 | Paper |
| Computational Short Cuts in Infinite Domain Constraint Satisfaction | 2023-01-09 | Paper |
| Complexity Classification Transfer for CSPs via Algebraic Products | 2022-11-07 | Paper |
| Fine-Grained Time Complexity of Constraint Satisfaction Problems | 2022-03-14 | Paper |
| A framework for analysing state-abstraction methods | 2021-12-13 | Paper |
| Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms | 2021-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005145 | 2021-08-04 | Paper |
| Computational Complexity of Computing Symmetries in Finite-Domain Planning | 2021-03-26 | Paper |
| Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics | 2021-01-22 | Paper |
| Time Complexity of Constraint Satisfaction via Universal Algebra | 2020-05-26 | Paper |
| Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis | 2019-05-15 | Paper |
| Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis | 2018-07-12 | Paper |
| Finite Unary Relations and Qualitative Constraint Satisfaction. | 2018-07-12 | Paper |
| Upper and Lower Time and Space Bounds for Planning | 2018-07-12 | Paper |
| Constants and finite unary relations in qualitative constraint reasoning | 2018-05-16 | Paper |
| Tractability conditions for numeric CSPs | 2018-02-09 | Paper |
| The Complexity of Phylogeny Constraint Satisfaction | 2018-01-24 | Paper |
| Time and Space Bounds for Planning | 2017-12-08 | Paper |
| Circuit satisfiability and constraint satisfaction around Skolem arithmetic | 2017-11-07 | Paper |
| The Complexity of Phylogeny Constraint Satisfaction Problems | 2017-10-16 | Paper |
| THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION | 2017-04-28 | Paper |
| A Model-Theoretic View on Qualitative Constraint Reasoning | 2017-04-10 | Paper |
| An initial study of time complexity in infinite-domain constraint satisfaction | 2017-02-28 | Paper |
| Refining complexity analyses in planning by exploiting the exponential time hypothesis | 2017-01-25 | Paper |
| Strong partial clones and the time complexity of SAT problems | 2016-11-14 | Paper |
| Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic | 2016-08-17 | Paper |
| Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems | 2016-06-09 | Paper |
| A nonapproximability result for finite function generation | 2016-05-26 | Paper |
| Constraint satisfaction and semilinear expansions of addition over the rationals and the reals | 2016-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457201 | 2015-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457202 | 2015-12-11 | Paper |
| Reasoning about temporal relations | 2015-11-12 | Paper |
| The approximability of MAX CSP with fixed-value constraints | 2015-11-11 | Paper |
| Building tractable disjunctive constraints | 2015-09-19 | Paper |
| Limitations of acyclic causal graphs for planning | 2015-08-27 | Paper |
| A complete parameterized complexity analysis of bounded planning | 2015-07-13 | Paper |
| Constructing NP-intermediate problems by blowing holes with parameters of various properties | 2015-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173168 | 2015-02-09 | Paper |
| Affine Consistency and the Complexity of Semilinear Constraints | 2014-10-14 | Paper |
| Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis | 2014-10-14 | Paper |
| Automaton plans | 2014-10-10 | Paper |
| Computational complexity of linear constraints over the integers | 2013-08-26 | Paper |
| A refined view of causal graphs and component sizes: SP-closed graph classes and beyond | 2013-08-13 | Paper |
| Properties of an approximability-related parameter on circular complete graphs | 2013-07-19 | Paper |
| Parameterized Complexity and Kernel Bounds for Hard Planning Problems | 2013-06-07 | Paper |
| Essential Convexity and Complexity of Semi-Algebraic Constraints | 2012-10-22 | Paper |
| Algorithms and limits for compact plan representations | 2012-08-27 | Paper |
| Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction | 2012-06-20 | Paper |
| Approximating integer programs with positive right-hand sides | 2012-01-18 | Paper |
| Min CSP on Four Elements: Moving beyond Submodularity | 2011-09-23 | Paper |
| Retractions to Pseudoforests | 2011-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576659 | 2010-07-30 | Paper |
| Approximability of clausal constraints | 2010-05-10 | Paper |
| Principles and Practice of Constraint Programming – CP 2003 | 2010-03-02 | Paper |
| Adding clauses to poor man's logic (without increasing the complexity) | 2009-11-30 | Paper |
| Hard constraint satisfaction problems have hard gaps at location 1 | 2009-09-10 | Paper |
| Approximability of the Maximum Solution Problem for Certain Families of Algebras | 2009-08-18 | Paper |
| Approximability Distance in the Space of H-Colourability Problems | 2009-08-18 | Paper |
| Semilinear Program Feasibility | 2009-07-14 | Paper |
| MAX ONES Generalized to Larger Domains | 2009-03-16 | Paper |
| Introduction to the Maximum Solution Problem | 2009-01-22 | Paper |
| The Maximum Solution Problem on Graphs | 2008-09-17 | Paper |
| Approximability of Integer Programming with Generalised Constraints | 2008-09-09 | Paper |
| Computational complexity of auditing finite attributes in statistical databases | 2008-06-26 | Paper |
| Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems | 2008-06-03 | Paper |
| Bounded Tree-Width and CSP-Related Problems | 2008-05-27 | Paper |
| Generalised Integer Programming Based on Logically Defined Relations | 2007-09-05 | Paper |
| Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights | 2007-05-30 | Paper |
| The Approximability of Three-valued MAX CSP | 2006-06-01 | Paper |
| Point algebras for temporal reasoning: Algorithms and complexity | 2006-02-07 | Paper |
| Complexity classification in qualitative temporal constraint reasoning | 2006-02-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Counting models for 2SAT and 3SAT formulae | 2005-04-06 | Paper |
| Constraint Satisfaction Problems on Intervals and Lengths | 2005-02-28 | Paper |
| The complexity of counting homomorphisms seen from the other side | 2005-02-09 | Paper |
| Recognizing frozen variables in constraint satisfaction problems | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828946 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808676 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736861 | 2004-08-11 | Paper |
| Algorithms for four variants of the exact satisfiability problem | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472556 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473047 | 2004-08-04 | Paper |
| Twenty-one large tractable subclasses of Allen's algebra | 2003-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708561 | 2003-06-18 | Paper |
| Disjunctions, independence, refinements | 2002-09-09 | Paper |
| Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495110 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495109 | 2000-08-10 | Paper |
| Strong bounds on the approximability of two Pspace-hard problems in propositional planning | 2000-06-07 | Paper |
| Towards efficient universal planning: A randomized approach | 2000-06-04 | Paper |
| Computational complexity of relating time points with intervals | 1999-06-21 | Paper |
| A complete classification of tractability in Allen's algebra relative to subsets of basic relations | 1999-03-02 | Paper |
| Reasoning about set constraints applied to tractable inference in intuitionistic logic | 1999-02-02 | Paper |
| A unifying approach to temporal constraint reasoning | 1999-01-12 | Paper |
| Tractable plan existence does not imply tractable plan generation | 1998-10-13 | Paper |
| State-variable planning under structural restrictions: algorithms and complexity | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386965 | 1998-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386967 | 1998-05-13 | Paper |
