| Publication | Date of Publication | Type |
|---|
| An algebraic characterization of tractable constraints | 2023-12-12 | Paper |
| Tractable constraints on ordered domains | 2022-09-21 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4967163 | 2019-07-03 | Paper |
| Simple Neural-Like P Systems for Maximal Independent Set Selection | 2019-06-12 | Paper |
| Binary constraint satisfaction problems defined by excluded topological minors | 2018-12-21 | Paper |
| Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge | 2018-05-17 | Paper |
| The power of propagation: when GAC is enough | 2018-02-22 | Paper |
| Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring | 2017-04-04 | Paper |
| Reasoning about temporal relations | 2015-11-12 | Paper |
| Building tractable disjunctive constraints | 2015-09-19 | Paper |
| Feedback from nature | 2015-03-02 | Paper |
| The complexity of maximal constraint languages | 2015-02-27 | Paper |
| An Algebraic Theory of Complexity for Discrete Optimization | 2014-02-04 | Paper |
| Representing and solving finite-domain constraint problems using systems of polynomials | 2013-08-26 | Paper |
| A Markov chain model of evolution in asexually reproducing populations: insight and analytical tractability in the evolutionary process | 2013-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113669 | 2012-01-23 | Paper |
| An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection | 2011-08-17 | Paper |
| Optimization Methods for the Partner Units Problem | 2011-05-26 | Paper |
| Classes of submodular constraints expressible by graph cuts | 2010-11-19 | Paper |
| Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination | 2010-09-02 | 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 |
| Presenting Constraints | 2009-12-01 | Paper |
| The Expressive Power of Binary Submodular Functions | 2009-10-16 | Paper |
| The complexity of constraint satisfaction games and QCSP | 2009-09-14 | 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 |
| 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 |
| Computer Science Logic | 2007-06-21 | Paper |
| Symmetry definitions for constraint satisfaction problems | 2006-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3365840 | 2006-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715675 | 2006-01-04 | Paper |
| Classifying the Complexity of Constraints Using Finite Algebras | 2005-09-16 | Paper |
| Supermodular functions and the complexity of MAX CSP | 2005-09-02 | Paper |
| Implementing a test for tractability | 2005-03-15 | Paper |
| Constraint Satisfaction Problems on Intervals and Lengths | 2005-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736861 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473024 | 2004-08-04 | Paper |
| New tractable classes from old | 2004-03-15 | Paper |
| Learnability of quantified formulas. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407431 | 2004-01-04 | Paper |
| Tractable constraints on ordered domains | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754150 | 2001-11-11 | Paper |
| How to determine the expressive power of constraints | 1999-09-07 | Paper |
| Constraints and universal algebra | 1999-05-03 | Paper |
| On the algebraic structure of combinatorial problems | 1999-01-20 | 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 |
| Counting representable sets on simple graphs | 1994-02-22 | Paper |
