default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Cohen
Person information
- affiliation: Royal Holloway, University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j34]Artem Kaznatcheev
, David A. Cohen, Peter Jeavons:
Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search. J. Artif. Intell. Res. 69: 1077-1102 (2020)- [j33]David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace:
Steepest ascent can be exponential in bounded treewidth problems. Oper. Res. Lett. 48(3): 217-224 (2020) - [c38]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Galois Connections for Patterns: An Algebra of Labelled Graphs. GKR 2020: 125-150
2010 – 2019
- 2019
- [j32]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica 81(4): 1699-1727 (2019) - [j31]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binary constraint satisfaction problems defined by excluded topological minors. Inf. Comput. 264: 12-31 (2019) - [c37]Artem Kaznatcheev, David A. Cohen, Peter G. Jeavons:
Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search. CP 2019: 300-316 - [i14]Artem Kaznatcheev, David A. Cohen, Peter G. Jeavons:
Representing fitness landscapes by valued constraints to understand the complexity of local search. CoRR abs/1907.01218 (2019) - [i13]David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace:
Steepest ascent can be exponential in bounded treewidth problems. CoRR abs/1911.08600 (2019) - 2018
- [c36]Martin C. Cooper, Wafa Jguirim, David A. Cohen:
Domain Reduction for Valued Constraints by Generalising Methods from CSP. CP 2018: 64-80 - [c35]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. STACS 2018: 19:1-19:15 - 2017
- [j30]David A. Cohen, Peter G. Jeavons:
The power of propagation: when GAC is enough. Constraints An Int. J. 22(1): 3-23 (2017) - [j29]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. SIAM J. Discret. Math. 31(4): 2279-2300 (2017) - [i12]Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný:
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns. CoRR abs/1704.06215 (2017) - 2016
- [j28]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. 32(1): 3-24 (2016) - [c34]David A. Cohen, Christopher Jefferson, Karen E. Petrie:
A Theoretical Framework for Constraint Propagator Triggering. SOCS 2016: 19-27 - [i11]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. CoRR abs/1608.01628 (2016) - [i10]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors. CoRR abs/1608.05358 (2016) - 2015
- [j27]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable and value elimination in binary constraint satisfaction via forbidden patterns. J. Comput. Syst. Sci. 81(7): 1127-1143 (2015) - [c33]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Binarisation via Dualisation for Valued Constraints. AAAI 2015: 3731-3737 - [c32]David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný:
Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. IJCAI 2015: 1945-1951 - [c31]Liang Chen, Tong Tong, Chin Pang Ho, Rajiv Patel, David A. Cohen, Angela C. Dawson, Omid Halse, Olivia Geraghty, Paul E. M. Rinne, Christopher J. White, Tagore Nakornchai, Paul Bentley, Daniel Rueckert:
Identification of Cerebral Small Vessel Disease Using Multiple Instance Learning. MICCAI (1) 2015: 523-530 - [i9]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable and value elimination in binary constraint satisfaction via forbidden patterns. CoRR abs/1502.03796 (2015) - [i8]David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. CoRR abs/1504.02420 (2015) - 2014
- [j26]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. 51: 555-577 (2014) - [c30]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW 2014: 48-59 - 2013
- [j25]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimization. SIAM J. Comput. 42(5): 1915-1939 (2013) - [c29]David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný:
Tractable Combinations of Global Constraints. CP 2013: 230-246 - [c28]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable Elimination in Binary CSP via Forbidden Patterns. IJCAI 2013: 517-523 - [i7]David A. Cohen, Jason Crampton, Gregory Z. Gutin, Mark Jones:
Pattern-Based Plan Construction for the Workflow Satisfiability Problem. CoRR abs/1306.3649 (2013) - [i6]David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný:
Tractable Combinations of Global Constraints. CoRR abs/1307.2867 (2013) - 2012
- [j24]David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon:
The Tractability of CSP Classes Defined by Forbidden Patterns. J. Artif. Intell. Res. 45: 47-78 (2012) - [i5]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimisation. CoRR abs/1207.6692 (2012) - 2011
- [c27]David A. Cohen, Martin C. Cooper, Martin James Green, Dániel Marx:
On Guaranteeing Polynomially Bounded Search Tree Size. CP 2011: 160-171 - [c26]David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. MFCS 2011: 231-242 - [i4]David A. Cohen, Martin C. Cooper, Páidí Creed, András Z. Salamon:
The tractability of CSP classes defined by forbidden patterns. CoRR abs/1103.1542 (2011) - [i3]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. CoRR abs/1107.0043 (2011) - 2010
- [j23]Michael D. J. Clements, David L. Dean, David A. Cohen:
Supplier selected relationships: choosing friends, over family. Int. J. Manuf. Technol. Manag. 19(1/2): 47-67 (2010)
2000 – 2009
- 2009
- [j22]Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The expressive power of binary submodular functions. Discret. Appl. Math. 157(15): 3347-3358 (2009) - [c25]David A. Cohen, Martin James Green, Chris Houghton:
Constraint Representations and Structural Tractability. CP 2009: 289-303 - [c24]Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The Expressive Power of Binary Submodular Functions. MFCS 2009: 744-757 - 2008
- [j21]Martin James Green, David A. Cohen:
Domain permutation reduction for constraint satisfaction problems. Artif. Intell. 172(8-9): 1094-1118 (2008) - [j20]David A. Cohen, Peter Jeavons, Marc Gyssens:
A unified theory of structural tractability for constraint satisfaction problems. J. Comput. Syst. Sci. 74(5): 721-743 (2008) - [j19]David A. Cohen, Martin C. Cooper, Peter Jeavons:
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theor. Comput. Sci. 401(1-3): 36-51 (2008) - [j18]David A. Cohen, Peter G. Jeavons, Stanislav Zivný:
The expressive power of valued constraints: Hierarchies and collapses. Theor. Comput. Sci. 409(1): 137-153 (2008) - [i2]Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The Expressive Power of Binary Submodular Functions. CoRR abs/0811.1885 (2008) - 2007
- [c23]David A. Cohen, Peter Jeavons, Stanislav Zivný:
The Expressive Power of Valued Constraints: Hierarchies and Collapses. CP 2007: 798-805 - 2006
- [j17]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
The complexity of soft constraint satisfaction. Artif. Intell. 170(11): 983-1016 (2006) - [j16]David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
Symmetry Definitions for Constraint Satisfaction Problems. Constraints An Int. J. 11(2-3): 115-137 (2006) - [c22]David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
Constraint Symmetry and Solution Symmetry. AAAI 2006: 1589-1592 - [c21]David A. Cohen, Martin C. Cooper, Peter Jeavons:
An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 - [c20]David A. Cohen, Martin James Green:
Typed Guarded Decompositions for Constraint Satisfaction. CP 2006: 122-136 - [c19]Chris Houghton, David A. Cohen, Martin James Green:
The Effect of Constraint Representation on Structural Tractability. CP 2006: 726-730 - [r1]David A. Cohen, Peter Jeavons:
The Complexity of Constraint Languages. Handbook of Constraint Programming 2006: 245-280 - [i1]David A. Cohen, Marc Gyssens, Peter Jeavons:
A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems. Complexity of Constraints 2006 - 2005
- [j15]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Supermodular functions and the complexity of MAX CSP. Discret. Appl. Math. 149(1-3): 53-72 (2005) - [c18]David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
Symmetry Definitions for Constraint Satisfaction Problems. CP 2005: 17-31 - [c17]Chris Houghton, David A. Cohen:
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems. CP 2005: 851 - [c16]David A. Cohen, Peter Jeavons, Marc Gyssens:
A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. IJCAI 2005: 72-77 - 2004
- [j14]David A. Cohen:
Tractable Decision for a Constraint Language Implies Tractable Search. Constraints An Int. J. 9(3): 219-229 (2004) - [j13]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. J. Artif. Intell. Res. 22: 1-22 (2004) - [c15]David A. Cohen:
EA-lect: an evolutionary algorithm for constructing logical rules to predict election into Cooperstown. IEEE Congress on Evolutionary Computation 2004: 1354-1361 - [c14]David A. Cohen, Martin C. Cooper, Peter Jeavons:
A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. CP 2004: 212-226 - [c13]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Identifying Efficiently Solvable Cases of Max CSP. STACS 2004: 152-163 - 2003
- [j12]David A. Cohen, Peter Jeavons, Richard Gault:
New Tractable Classes From Old. Constraints An Int. J. 8(3): 263-282 (2003) - [c12]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Soft Constraints: Complexity and Multimorphisms. CP 2003: 244-258 - [c11]Martin James Green, David A. Cohen:
Tractability by Approximating Constraint Languages. CP 2003: 392-406 - [c10]David A. Cohen:
A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure. CP 2003: 807-811 - [c9]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. IJCAI 2003: 209-214 - 2000
- [j11]David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis:
Building tractable disjunctive constraints. J. ACM 47(5): 826-853 (2000) - [c8]David A. Cohen, Peter Jeavons, Richard Gault:
New Tractable Classes from Old. CP 2000: 160-171
1990 – 1999
- 1999
- [j10]Peter Jeavons, David A. Cohen, Marc Gyssens:
How to Determine the Expressive Power of Constraints. Constraints An Int. J. 4(2): 113-131 (1999) - 1998
- [j9]Peter Jeavons, David A. Cohen, Martin C. Cooper:
Constraints, Consistency and Closure. Artif. Intell. 101(1-2): 251-265 (1998) - [j8]Peter Jeavons, David A. Cohen, Justin Pearson:
Constraints and Universal Algebra. Ann. Math. Artif. Intell. 24(1-4): 51-67 (1998) - 1997
- [j7]Peter Jeavons, David A. Cohen, Marc Gyssens:
Closure properties of constraints. J. ACM 44(4): 527-548 (1997) - [c7]David A. Cohen, Peter Jeavons, Manolis Koubarakis:
Tractable Disjunctive Constraints. CP 1997: 478-490 - 1996
- [c6]David A. Cohen, Marc Gyssens, Peter Jeavons:
Derivation of Constraints and Database Relations. CP 1996: 134-148 - [c5]Peter Jeavons, David A. Cohen, Marc Gyssens:
A test for Tractability. CP 1996: 267-281 - 1995
- [c4]Peter Jeavons, David A. Cohen:
An Algebraic Characterization of Tractable Constraints. COCOON 1995: 633-642 - [c3]Peter Jeavons, David A. Cohen, Marc Gyssens:
A Unifying Framework for Tractable Constraints. CP 1995: 276-291 - 1994
- [j6]Martin C. Cooper, David A. Cohen, Peter Jeavons:
Characterising Tractable Constraints. Artif. Intell. 65(2): 347-361 (1994) - [j5]Marc Gyssens, Peter Jeavons, David A. Cohen:
Decomposing Constraint Satisfaction Problems Using Database Techniques. Artif. Intell. 66(1): 57-89 (1994) - [j4]Peter Jeavons, David A. Cohen, John Shawe-Taylor:
Generating binary sequences for stochastic computing. IEEE Trans. Inf. Theory 40(3): 716-720 (1994) - [c2]Peter Jeavons, David A. Cohen, Martin C. Cooper:
A Substitution Operation for Constraints. PPCP 1994: 1-9 - 1992
- [j3]David A. Cohen, Elizabeth A. Scott:
Rationality of Division Orderings. Inf. Process. Lett. 44(6): 307-311 (1992) - [c1]Martin Anthony, Graham R. Brightwell, David A. Cohen, John Shawe-Taylor:
On Exact Specification by Examples. COLT 1992: 311-318 - 1990
- [j2]John Shawe-Taylor, David A. Cohen:
Linear programming algorithm for neural networks. Neural Networks 3(5): 575-582 (1990)
1980 – 1989
- 1988
- [j1]David A. Cohen, C. Mannion, John Shawe-Taylor:
Transformational theory of feedforward neural networks. Neural Networks 1(Supplement-1): 83-84 (1988)
Coauthor Index
Peter Jeavons 0001
aka: Peter G. Jeavons
aka: Peter G. Jeavons
[j34] [c38] [j31] [c37] [i14] [j30] [j29] [i11] [i10] [c33] [c32] [j25] [c29] [i6] [i5] [c26] [i3] [j22] [c24] [j20] [j19] [j18] [i2] [c23] [j17] [j16] [c22] [c21] [r1] [i1] [j15] [c18] [c16] [j13] [c14] [c13] [j12] [c12] [c9] [j11] [c8] [j10] [j9] [j8] [j7] [c7] [c6] [c5] [c4] [c3] [j6] [j5] [j4] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
