| Publication | Date of Publication | Type |
|---|
An algebraic characterization of tractable constraints
Lecture Notes in Computer Science | 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
Journal of Artificial Intelligence Research | 2020-12-09 | Paper |
On singleton arc consistency for CSPs defined by monotone patterns
(available as arXiv preprint) | 2020-08-05 | Paper |
On singleton arc consistency for CSPs defined by monotone patterns
Algorithmica | 2019-04-25 | Paper |
Binary constraint satisfaction problems defined by excluded topological minors
Information and Computation | 2018-12-21 | Paper |
Binary constraint satisfaction problems defined by excluded topological minors
Information and Computation | 2018-12-21 | Paper |
The power of propagation: when GAC is enough
Constraints | 2018-02-22 | Paper |
Building tractable disjunctive constraints
Journal of the ACM | 2015-09-19 | Paper |
Variable and value elimination in binary constraint satisfaction via forbidden patterns
Journal of Computer and System Sciences | 2015-07-13 | Paper |
An algebraic theory of complexity for discrete optimization.
SIAM Journal on Computing | 2014-02-04 | Paper |
An algebraic theory of complexity for discrete optimization.
SIAM Journal on Computing | 2014-02-04 | Paper |
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research | 2012-12-03 | Paper |
An algebraic theory of complexity for valued constraints: establishing a Galois connection
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
The expressive power of binary submodular functions
Discrete Applied Mathematics | 2010-04-28 | Paper |
A new class of binary CSPs for which arc-consistency is a decision procedure
Lecture Notes in Computer Science | 2010-03-02 | Paper |
Soft constraints: complexity and multimorphisms
Lecture Notes in Computer Science | 2010-03-02 | Paper |
Tractability by approximating constraint languages
Lecture Notes in Computer Science | 2010-03-02 | Paper |
The Expressive Power of Binary Submodular Functions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence | 2009-07-17 | Paper |
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science | 2008-12-12 | Paper |
Typed Guarded Decompositions for Constraint Satisfaction
Principles and Practice of Constraint Programming - CP 2006 | 2008-09-09 | Paper |
The Effect of Constraint Representation on Structural Tractability
Principles and Practice of Constraint Programming - CP 2006 | 2008-09-09 | Paper |
Symmetry Definitions for Constraint Satisfaction Problems
Principles and Practice of Constraint Programming - CP 2005 | 2008-09-09 | Paper |
An Algebraic Characterisation of Complexity for Valued Constraint
Principles and Practice of Constraint Programming - CP 2006 | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
The Expressive Power of Valued Constraints: Hierarchies and Collapses
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
Theoretical Computer Science | 2008-07-31 | Paper |
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences | 2008-06-26 | Paper |
The complexity of soft constraint satisfaction
Artificial Intelligence | 2007-10-23 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Symmetry definitions for constraint satisfaction problems
Constraints | 2006-11-03 | Paper |
scientific article; zbMATH DE number 2243365 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics | 2005-09-02 | Paper |
Tractable decision for a constraint language implies tractable search
Constraints | 2005-03-15 | Paper |
| scientific article; zbMATH DE number 2080305 (Why is no real title available?) | 2004-08-04 | Paper |
New tractable classes from old
Constraints | 2004-03-15 | Paper |
How to determine the expressive power of constraints
Constraints | 1999-09-07 | Paper |
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence | 1999-05-03 | Paper |
Constraints, consistency and closure
Artificial Intelligence | 1999-01-12 | Paper |
Closure properties of constraints
Journal of the ACM | 1998-02-17 | Paper |
| scientific article; zbMATH DE number 1113817 (Why is no real title available?) | 1998-02-08 | Paper |
| scientific article; zbMATH DE number 1008453 (Why is no real title available?) | 1997-11-10 | Paper |
| scientific article; zbMATH DE number 718859 (Why is no real title available?) | 1995-06-08 | Paper |
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence | 1995-01-02 | Paper |
Characterising tractable constraints
Artificial Intelligence | 1994-05-03 | Paper |
Rationality of division orderings
Information Processing Letters | 1993-05-16 | Paper |
Splitting integrators for linear Vlasov equations with stochastic perturbations
(available as arXiv preprint) | N/A | Paper |
