Counting Representable Sets on Simple Graphs. - Peter Jeavons 001 (Discret. Appl. Math., 1993)

A Substitution Operation for Constraints. - Peter Jeavons 001; David A. Cohen; Martin C. Cooper (PPCP, 1994)

Characterising Tractable Constraints. - Martin C. Cooper; David A. Cohen; Peter Jeavons 001 (Artif. Intell., 1994)

Decomposing Constraint Satisfaction Problems Using Database Techniques. - Marc Gyssens; Peter Jeavons 001; David A. Cohen (Artif. Intell., 1994)

Recovering a Relation from a Decomposition Using Constraint Satisfaction. - Peter Jeavons 001 (Inf. Sci., 1994)

Generating binary sequences for stochastic computing. - Peter Jeavons 001; David A. Cohen; John Shawe-Taylor (IEEE Trans. Inf. Theory, 1994)

An Algebraic Characterization of Tractable Constraints. - Peter Jeavons 001; David A. Cohen (COCOON, 1995)

A Unifying Framework for Tractable Constraints. - Peter Jeavons 001; David A. Cohen; Marc Gyssens (CP, 1995)

Tractable Constraints on Ordered Domains. - Peter Jeavons 001; Martin C. Cooper (Artif. Intell., 1995)

Derivation of Constraints and Database Relations. - David A. Cohen; Marc Gyssens; Peter Jeavons 001 (CP, 1996)

A test for Tractability. - Peter Jeavons 001; David A. Cohen; Marc Gyssens (CP, 1996)

Tractable Disjunctive Constraints. - David A. Cohen; Peter Jeavons 001; Manolis Koubarakis (CP, 1997)

Closure properties of constraints. - Peter Jeavons 001; David A. Cohen; Marc Gyssens (J. ACM, 1997)

Constructing Constraints. - Peter Jeavons 001 (CP, 1998)

Constraints, Consistency and Closure. - Peter Jeavons 001; David A. Cohen; Martin C. Cooper (Artif. Intell., 1998)

Constraints and Universal Algebra. - Peter Jeavons 001; David A. Cohen; Justin Pearson (Ann. Math. Artif. Intell., 1998)

On the Algebraic Structure of Combinatorial Problems. - Peter Jeavons 001 (Theor. Comput. Sci., 1998)

How to Determine the Expressive Power of Constraints. - Peter Jeavons 001; David A. Cohen; Marc Gyssens (Constraints An Int. J., 1999)

Constraint Satisfaction Problems and Finite Algebras. - Andrei A. Bulatov; Andrei A. Krokhin; Peter Jeavons 001 (ICALP, 2000)

Building tractable disjunctive constraints. - David A. Cohen; Peter Jeavons 001; Peter Jonsson; Manolis Koubarakis (J. ACM, 2000)

A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. - Andrei A. Krokhin; Peter Jeavons 001; Peter Jonsson (IJCAI, 2001)

The complexity of maximal constraint languages. - Andrei A. Bulatov; Andrei A. Krokhin; Peter Jeavons 001 (STOC, 2001)

Automatic analysis of agarose gel images. - P. S. Umesh Adiga; A. Bhomra; Maria Grazia Turri; A. Nicod; S. R. Datta; Peter Jeavons 001; Richard Mott; Jonathan Flint (Bioinform., 2001)

The complexity of constraints on intervals and lengths - Andrei A. Krokhin; Peter Jeavons 001; Peter Jonsson (Electron. Colloquium Comput. Complex., 2001)

An Algebraic Approach to Multi-sorted Constraints. - Andrei A. Bulatov; Peter Jeavons 001 (CP, 2003)

Soft Constraints: Complexity and Multimorphisms. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001; Andrei A. Krokhin (CP, 2003)

Quantified Constraints: Algorithms and Complexity. - Ferdinand Börner; Andrei A. Bulatov; Peter Jeavons 001; Andrei A. Krokhin (CSL, 2003)

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. - Andrei A. Krokhin; Andrei A. Bulatov; Peter Jeavons 001 (ISMVL, 2003)

New Tractable Classes From Old. - David A. Cohen; Peter Jeavons 001; Richard Gault (Constraints An Int. J., 2003)

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. - Andrei A. Krokhin; Peter Jeavons 001; Peter Jonsson (J. ACM, 2003)

Learnability of quantified formulas. - Víctor Dalmau; Peter Jeavons 001 (Theor. Comput. Sci., 2003)

A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001 (CP, 2004)

Identifying Efficiently Solvable Cases of Max CSP. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001; Andrei A. Krokhin (STACS, 2004)

Implementing a Test for Tractability. - Richard Gault; Peter Jeavons 001 (Constraints An Int. J., 2004)

A Maximal Tractable Class of Soft Constraints. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001; Andrei A. Krokhin (J. Artif. Intell. Res., 2004)

Constraint Satisfaction Problems on Intervals and Length. - Andrei A. Krokhin; Peter Jeavons 001; Peter Jonsson (SIAM J. Discret. Math., 2004)

A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. - David A. Cohen; Peter Jeavons 001; Marc Gyssens (IJCAI, 2005)

E-library of medieval chant manuscript transcriptions. - Louis W. G. Barton; John A. Caldwell; Peter Jeavons 001 (JCDL, 2005)

Supermodular functions and the complexity of MAX CSP. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001; Andrei A. Krokhin (Discret. Appl. Math., 2005)

Classifying the Complexity of Constraints Using Finite Algebras. - Andrei A. Bulatov; Peter Jeavons 001; Andrei A. Krokhin (SIAM J. Comput., 2005)

Constraint Symmetry and Solution Symmetry. - David A. Cohen; Peter Jeavons 001; Christopher Jefferson; Karen E. Petrie; Barbara M. Smith (AAAI, 2006)

An Algebraic Characterisation of Complexity for Valued Constraint. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001 (CP, 2006)

A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems. - David A. Cohen; Marc Gyssens; Peter Jeavons 001 (Complexity of Constraints, 2006)

The complexity of soft constraint satisfaction. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001; Andrei A. Krokhin (Artif. Intell., 2006)

Symmetry Definitions for Constraint Satisfaction Problems. - David A. Cohen; Peter Jeavons 001; Christopher Jefferson; Karen E. Petrie; Barbara M. Smith (Constraints An Int. J., 2006)

Enhancing the Prediction of Transcription Factor Binding Sites by Incorporating Structural Properties and Nucleotide Covariations. - Sumedha Gunewardena; Peter Jeavons 001; Zhaolei Zhang (J. Comput. Biol., 2006)

The Complexity of Constraint Languages. - David A. Cohen; Peter Jeavons 001 (Handbook of Constraint Programming, 2006)

Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs. - Gaofeng Huang; Peter Jeavons 001; Dominic Kwiatkowski (APBC, 2007)

A Geometrical Model for the SNP Motif Identification Problem. - Gaofeng Huang; Peter Jeavons 001 (BIBE, 2007)

First class objects and indexes for chant manuscripts. - Louis W. G. Barton; Peter Jeavons 001; John A. Caldwell; Koon Shan Barry Ng (JCDL, 2007)

Perfect Constraints Are Tractable. - András Z. Salamon; Peter G. Jeavons (CP, 2008)

Hybrid tractable CSPs which generalize tree structure. - Martin C. Cooper; Peter G. Jeavons; András Z. Salamon (ECAI, 2008)

A unified theory of structural tractability for constraint satisfaction problems. - David A. Cohen; Peter Jeavons 001; Marc Gyssens (J. Comput. Syst. Sci., 2008)

Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. - David A. Cohen; Martin C. Cooper; Peter Jeavons 001 (Theor. Comput. Sci., 2008)

The expressive power of valued constraints: Hierarchies and collapses. - David A. Cohen; Peter G. Jeavons; Stanislav Zivný (Theor. Comput. Sci., 2008)

The Complexity of Valued Constraint Models. - Stanislav Zivný; Peter G. Jeavons (CP, 2009)

Presenting Constraints. - Peter Jeavons 001 (TABLEAUX, 2009)

The expressive power of binary submodular functions. - Stanislav Zivný; David A. Cohen; Peter G. Jeavons (Discret. Appl. Math., 2009)

The complexity of constraint satisfaction games and QCSP. - Ferdinand Börner; Andrei A. Bulatov; Hubie Chen; Peter Jeavons 001; Andrei A. Krokhin (Inf. Comput., 2009)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. - Martin C. Cooper; Peter G. Jeavons; András Z. Salamon (Artif. Intell., 2010)

Classes of submodular constraints expressible by graph cuts. - Stanislav Zivný; Peter G. Jeavons (Constraints An Int. J., 2010)

Optimization Methods for the Partner Units Problem. - Markus Aschinger; Conrad Drescher; Gerhard Friedrich; Georg Gottlob; Peter Jeavons 001; Anna Ryabokon; Evgenij Thorstensen (CPAIOR, 2011)

Tackling the Partner Units Configuration Problem. - Markus Aschinger; Conrad Drescher; Georg Gottlob; Peter Jeavons 001; Evgenij Thorstensen (IJCAI, 2011)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. - David A. Cohen; Páidí Creed; Peter G. Jeavons; Stanislav Zivný (MFCS, 2011)

The Order Encoding: From Tractable CSP to Tractable SAT. - Justyna Petke; Peter Jeavons 001 (SAT, 2011)

Structural Decomposition Methods and What They are Good For. - Markus Aschinger; Conrad Drescher; Georg Gottlob; Peter Jeavons 001; Evgenij Thorstensen (STACS, 2011)

An Algebraic Theory of Complexity for Discrete Optimisation - David A. Cohen; Martin C. Cooper; Páidí Creed; Peter G. Jeavons; Stanislav Zivný (CoRR, 2012)

Local Consistency and SAT-Solvers. - Peter Jeavons 001; Justyna Petke (J. Artif. Intell. Res., 2012)

Tractable Combinations of Global Constraints. - David A. Cohen; Peter G. Jeavons; Evgenij Thorstensen; Stanislav Zivný (CP, 2013)

Feedback from nature: an optimal distributed algorithm for maximal independent set selection. - Alex Scott 001; Peter Jeavons 001; Lei Xu 002 (PODC, 2013)

Representing and solving finite-domain constraint problems using systems of polynomials. - Christopher Jefferson; Peter Jeavons 001; Martin James Green; Marc R. C. van Dongen (Ann. Math. Artif. Intell., 2013)

A Polynomial-Time Solution to Constraint Satisfaction Problems by Neural-like P Systems. - Lei Xu 002; Xiangxiang Zeng; Peter Jeavons 001 (Int. J. Unconv. Comput., 2013)

Simple Neural-Like P Systems for Maximal Independent Set Selection. - Lei Xu 002; Peter G. Jeavons (Neural Comput., 2013)

An Algebraic Theory of Complexity for Discrete Optimization. - David A. Cohen; Martin C. Cooper; Páidí Creed; Peter G. Jeavons; Stanislav Zivný (SIAM J. Comput., 2013)

Tractable Valued Constraints. - Peter G. Jeavons; Stanislav Zivný (Tractability, 2014)

Led by nature: Distributed leader election in anonymous networks. - Lei Xu 002; Peter Jeavons 001 (ICNC, 2014)

The Complexity of Valued Constraint Satisfaction. - Peter Jeavons 001; Andrei A. Krokhin; Stanislav Zivný (Bull. EATCS, 2014)

Binarisation via Dualisation for Valued Constraints. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (AAAI, 2015)

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (IJCAI, 2015)

Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies. - Lei Xu 002; Peter Jeavons 001 (Int. J. Neural Syst., 2015)

Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge. - Lei Xu 002; Peter Jeavons 001 (Inf. Sci., 2015)

Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance. - Daniel Nichol; Peter Jeavons 001; Alexander G. Fletcher; Robert A. Bonomo; Philip K. Maini; Jerome L. Paul; Robert A. Gatenby; Alexander R. A. Anderson; Jacob G. Scott (PLoS Comput. Biol., 2015)

Minimal Weighted Clones with Boolean Support. - Peter G. Jeavons; Andrius Vaicenavicius; Stanislav Zivný (ISMVL, 2016)

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring. - Peter Jeavons 001; Alex Scott 001; Lei Xu 002 (Distributed Comput., 2016)

Finding Graph Decompositions via SAT. - Wenting Zhao 002; Mark H. Liffiton; Peter Jeavons 001; Dan Roberts (ICTAI, 2017)

The power of propagation: when GAC is enough. - David A. Cohen; Peter G. Jeavons (Constraints An Int. J., 2017)

Binarisation for Valued Constraint Satisfaction Problems. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Andrei A. Krokhin; Robert Powell; Stanislav Zivný (SIAM J. Discret. Math., 2017)

Binary constraint satisfaction problems defined by excluded topological minors. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (Inf. Comput., 2019)

Galois Connections for Patterns: An Algebra of Labelled Graphs. - David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Stanislav Zivný (GKR, 2020)

Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search. - Artem Kaznatcheev; David A. Cohen; Peter Jeavons 001 (J. Artif. Intell. Res., 2020)