Peter Jeavons

According to our database1, Peter Jeavons authored at least 89 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Binary constraint satisfaction problems defined by excluded topological minors.
Inf. Comput., 2019

Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2017
Binarisation for Valued Constraint Satisfaction Problems.
SIAM J. Discrete Math., 2017

The power of propagation: when GAC is enough.
Constraints, 2017

Finding Graph Decompositions via SAT.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring.
Distributed Computing, 2016

Minimal Weighted Clones with Boolean Support.
Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

2015
Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance.
PLoS Computational Biology, 2015

Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge.
Inf. Sci., 2015

Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies.
Int. J. Neural Syst., 2015

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Binarisation via Dualisation for Valued Constraints.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
The Complexity of Valued Constraint Satisfaction.
Bulletin of the EATCS, 2014

Led by nature: Distributed leader election in anonymous networks.
Proceedings of the 10th International Conference on Natural Computation, 2014

Tractable Valued Constraints.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013
An Algebraic Theory of Complexity for Discrete Optimization.
SIAM J. Comput., 2013

Simple Neural-Like P Systems for Maximal Independent Set Selection.
Neural Computation, 2013

A Polynomial-Time Solution to Constraint Satisfaction Problems by Neural-like P Systems.
IJUC, 2013

Representing and solving finite-domain constraint problems using systems of polynomials.
Ann. Math. Artif. Intell., 2013

Feedback from nature: an optimal distributed algorithm for maximal independent set selection.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Tractable Combinations of Global Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Local Consistency and SAT-Solvers.
J. Artif. Intell. Res., 2012

An Algebraic Theory of Complexity for Discrete Optimisation
CoRR, 2012

2011
Structural Decomposition Methods and What They are Good For.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

The Order Encoding: From Tractable CSP to Tractable SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Tackling the Partner Units Configuration Problem.
Proceedings of the IJCAI 2011, 2011

Optimization Methods for the Partner Units Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010
Classes of submodular constraints expressible by graph cuts.
Constraints, 2010

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.
Artif. Intell., 2010

2009
The complexity of constraint satisfaction games and QCSP.
Inf. Comput., 2009

The expressive power of binary submodular functions.
Discrete Applied Mathematics, 2009

Presenting Constraints.
Proceedings of the 7th International Workshop on First-Order Theorem Proving, 2009

The Complexity of Valued Constraint Models.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
The expressive power of valued constraints: Hierarchies and collapses.
Theor. Comput. Sci., 2008

Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms.
Theor. Comput. Sci., 2008

A unified theory of structural tractability for constraint satisfaction problems.
J. Comput. Syst. Sci., 2008

Hybrid tractable CSPs which generalize tree structure.
Proceedings of the ECAI 2008, 2008

Perfect Constraints Are Tractable.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
First class objects and indexes for chant manuscripts.
Proceedings of the ACM/IEEE Joint Conference on Digital Libraries, 2007

A Geometrical Model for the SNP Motif Identification Problem.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
The Complexity of Constraint Languages.
Proceedings of the Handbook of Constraint Programming, 2006

Enhancing the Prediction of Transcription Factor Binding Sites by Incorporating Structural Properties and Nucleotide Covariations.
Journal of Computational Biology, 2006

Symmetry Definitions for Constraint Satisfaction Problems.
Constraints, 2006

The complexity of soft constraint satisfaction.
Artif. Intell., 2006

A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems.
Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

An Algebraic Characterisation of Complexity for Valued Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Constraint Symmetry and Solution Symmetry.
Proceedings of the Proceedings, 2006

2005
Classifying the Complexity of Constraints Using Finite Algebras.
SIAM J. Comput., 2005

Supermodular functions and the complexity of MAX CSP.
Discrete Applied Mathematics, 2005

E-library of medieval chant manuscript transcriptions.
Proceedings of the ACM/IEEE Joint Conference on Digital Libraries, 2005

A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
Constraint Satisfaction Problems on Intervals and Length.
SIAM J. Discrete Math., 2004

A Maximal Tractable Class of Soft Constraints.
J. Artif. Intell. Res., 2004

Implementing a Test for Tractability.
Constraints, 2004

Identifying Efficiently Solvable Cases of Max CSP.
Proceedings of the STACS 2004, 2004

A Complete Characterization of Complexity for Boolean Constraint Optimization Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
Learnability of quantified formulas.
Theor. Comput. Sci., 2003

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra.
J. ACM, 2003

New Tractable Classes From Old.
Constraints, 2003

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey.
Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

Quantified Constraints: Algorithms and Complexity.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Soft Constraints: Complexity and Multimorphisms.
Proceedings of the Principles and Practice of Constraint Programming, 2003

An Algebraic Approach to Multi-sorted Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2001
The complexity of constraints on intervals and lengths
Electronic Colloquium on Computational Complexity (ECCC), 2001

Automatic analysis of agarose gel images.
Bioinformatics, 2001

The complexity of maximal constraint languages.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Building tractable disjunctive constraints.
J. ACM, 2000

Constraint Satisfaction Problems and Finite Algebras.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
How to Determine the Expressive Power of Constraints.
Constraints, 1999

1998
On the Algebraic Structure of Combinatorial Problems.
Theor. Comput. Sci., 1998

Constraints and Universal Algebra.
Ann. Math. Artif. Intell., 1998

Constraints, Consistency and Closure.
Artif. Intell., 1998

Constructing Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1998

1997
Closure properties of constraints.
J. ACM, 1997

Tractable Disjunctive Constraints.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996
A test for Tractability.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Derivation of Constraints and Database Relations.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995
Tractable Constraints on Ordered Domains.
Artif. Intell., 1995

A Unifying Framework for Tractable Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1995

An Algebraic Characterization of Tractable Constraints.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Generating binary sequences for stochastic computing.
IEEE Trans. Information Theory, 1994

Recovering a Relation from a Decomposition Using Constraint Satisfaction.
Inf. Sci., 1994

Decomposing Constraint Satisfaction Problems Using Database Techniques.
Artif. Intell., 1994

Characterising Tractable Constraints.
Artif. Intell., 1994

A Substitution Operation for Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1994

1993
Counting Representable Sets on Simple Graphs.
Discrete Applied Mathematics, 1993


  Loading...