# David A. Cohen

According to our database

Collaborative distances:

^{1}, David A. Cohen authored at least 70 papers between 1988 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

Steepest ascent can be exponential in bounded treewidth problems.

CoRR, 2019

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns.

Algorithmica, 2019

Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search.

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

Domain Reduction for Valued Constraints by Generalising Methods from CSP.

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

Binarisation for Valued Constraint Satisfaction Problems.

SIAM J. Discrete Math., 2017

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns.

CoRR, 2017

The power of propagation: when GAC is enough.

Constraints, 2017

2016

Algorithms for the workflow satisfiability problem engineered for counting constraints.

J. Comb. Optim., 2016

A Theoretical Framework for Constraint Propagator Triggering.

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

2015

Variable and value elimination in binary constraint satisfaction via forbidden patterns.

J. Comput. Syst. Sci., 2015

Identification of Cerebral Small Vessel Disease Using Multiple Instance Learning.

Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2015, 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

Iterative Plan Construction for the Workflow Satisfiability Problem.

J. Artif. Intell. Res., 2014

Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013

An Algebraic Theory of Complexity for Discrete Optimization.

SIAM J. Comput., 2013

Pattern-Based Plan Construction for the Workflow Satisfiability Problem.

CoRR, 2013

Variable Elimination in Binary CSP via Forbidden Patterns.

Proceedings of the IJCAI 2013, 2013

Tractable Combinations of Global Constraints.

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

The Tractability of CSP Classes Defined by Forbidden Patterns.

J. Artif. Intell. Res., 2012

An Algebraic Theory of Complexity for Discrete Optimisation

CoRR, 2012

2011

The tractability of CSP classes defined by forbidden patterns

CoRR, 2011

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

On Guaranteeing Polynomially Bounded Search Tree Size.

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Supplier selected relationships: choosing friends, over family.

IJMTM, 2010

2009

The expressive power of binary submodular functions.

Discrete Applied Mathematics, 2009

Constraint Representations and Structural Tractability.

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

Domain permutation reduction for constraint satisfaction problems.

Artif. Intell., 2008

2006

The Complexity of Constraint Languages.

Proceedings of the Handbook of Constraint Programming, 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

The Effect of Constraint Representation on Structural Tractability.

Proceedings of the Principles and Practice of Constraint Programming, 2006

Typed Guarded Decompositions for Constraint Satisfaction.

Proceedings of the Principles and Practice of Constraint Programming, 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

Supermodular functions and the complexity of MAX CSP.

Discrete Applied Mathematics, 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

Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems.

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

A Maximal Tractable Class of Soft Constraints.

J. Artif. Intell. Res., 2004

Tractable Decision for a Constraint Language Implies Tractable Search.

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

EA-lect: an evolutionary algorithm for constructing logical rules to predict election into Cooperstown.

Proceedings of the IEEE Congress on Evolutionary Computation, 2004

2003

New Tractable Classes From Old.

Constraints, 2003

Tractability by Approximating Constraint Languages.

Proceedings of the Principles and Practice of Constraint Programming, 2003

Soft Constraints: Complexity and Multimorphisms.

Proceedings of the Principles and Practice of Constraint Programming, 2003

A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure.

Proceedings of the Principles and Practice of Constraint Programming, 2003

2000

Building tractable disjunctive constraints.

J. ACM, 2000

1999

How to Determine the Expressive Power of Constraints.

Constraints, 1999

1998

Constraints and Universal Algebra.

Ann. Math. Artif. Intell., 1998

Constraints, Consistency and Closure.

Artif. Intell., 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

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

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

1992

Rationality of Division Orderings.

Inf. Process. Lett., 1992

On Exact Specification by Examples.

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1990

Linear programming algorithm for neural networks.

Neural Networks, 1990

1988

Transformational theory of feedforward neural networks.

Neural Networks, 1988