| Publication | Date of Publication | Type |
|---|
| An algebraic characterization of tractable constraints | 2023-12-12 | Paper |
| Positivity-preserving schemes for some nonlinear stochastic PDEs | 2023-04-21 | Paper |
| Analysis of a positivity-preserving splitting scheme for some nonlinear stochastic heat equations | 2023-02-17 | Paper |
| Galois connections for patterns: an algebra of labelled graphs | 2021-08-04 | Paper |
| Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search | 2020-12-09 | Paper |
| On Singleton Arc Consistency for CSPs Defined by Monotone Patterns | 2020-08-05 | Paper |
| On singleton arc consistency for CSPs defined by monotone patterns | 2019-04-25 | Paper |
| Binary constraint satisfaction problems defined by excluded topological minors | 2018-12-21 | Paper |
| The power of propagation: when GAC is enough | 2018-02-22 | Paper |
| Building tractable disjunctive constraints | 2015-09-19 | Paper |
| Variable and value elimination in binary constraint satisfaction via forbidden patterns | 2015-07-13 | Paper |
| An Algebraic Theory of Complexity for Discrete Optimization | 2014-02-04 | Paper |
| The Tractability of CSP Classes Defined by Forbidden Patterns | 2012-12-03 | Paper |
| An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection | 2011-08-17 | Paper |
| The expressive power of binary submodular functions | 2010-04-28 | Paper |
| Principles and Practice of Constraint Programming – CP 2003 | 2010-03-02 | Paper |
| Principles and Practice of Constraint Programming – CP 2003 | 2010-03-02 | Paper |
| Principles and Practice of Constraint Programming – CP 2003 | 2010-03-02 | Paper |
| The Expressive Power of Binary Submodular Functions | 2009-10-16 | Paper |
| Domain permutation reduction for constraint satisfaction problems | 2009-07-17 | Paper |
| The expressive power of valued constraints: Hierarchies and collapses | 2008-12-12 | Paper |
| Symmetry Definitions for Constraint Satisfaction Problems | 2008-09-09 | Paper |
| An Algebraic Characterisation of Complexity for Valued Constraint | 2008-09-09 | Paper |
| Typed Guarded Decompositions for Constraint Satisfaction | 2008-09-09 | Paper |
| The Effect of Constraint Representation on Structural Tractability | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| The Expressive Power of Valued Constraints: Hierarchies and Collapses | 2008-09-02 | Paper |
| Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms | 2008-07-31 | Paper |
| A unified theory of structural tractability for constraint satisfaction problems | 2008-06-26 | Paper |
| The complexity of soft constraint satisfaction | 2007-10-23 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Symmetry definitions for constraint satisfaction problems | 2006-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715675 | 2006-01-04 | Paper |
| Supermodular functions and the complexity of MAX CSP | 2005-09-02 | Paper |
| Tractable decision for a constraint language implies tractable search | 2005-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473024 | 2004-08-04 | Paper |
| New tractable classes from old | 2004-03-15 | Paper |
| How to determine the expressive power of constraints | 1999-09-07 | Paper |
| Constraints and universal algebra | 1999-05-03 | Paper |
| Constraints, consistency and closure | 1999-01-12 | Paper |
| Closure properties of constraints | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375590 | 1998-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336206 | 1997-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320816 | 1995-06-08 | Paper |
| Decomposing constraint satisfaction problems using database techniques | 1995-01-02 | Paper |
| Characterising tractable constraints | 1994-05-03 | Paper |
| Rationality of division orderings | 1993-05-16 | Paper |
