default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Cohen
- > Home > Persons > David A. Cohen
Publications
- 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 - 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) - [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
- [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
- [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 - [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) - 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) - [c28]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable Elimination in Binary CSP via Forbidden Patterns. IJCAI 2013: 517-523 - 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 - [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) - 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) - 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) - [c21]David A. Cohen, Martin C. Cooper, Peter Jeavons:
An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 - 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) - 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) - [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
- [c12]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Soft Constraints: Complexity and Multimorphisms. CP 2003: 244-258 - [c9]David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
A Maximal Tractable Class of Soft Constraints. IJCAI 2003: 209-214 - 1998
- [j9]Peter Jeavons, David A. Cohen, Martin C. Cooper:
Constraints, Consistency and Closure. Artif. Intell. 101(1-2): 251-265 (1998) - 1994
- [j6]Martin C. Cooper, David A. Cohen, Peter Jeavons:
Characterising Tractable Constraints. Artif. Intell. 65(2): 347-361 (1994) - [c2]Peter Jeavons, David A. Cohen, Martin C. Cooper:
A Substitution Operation for Constraints. PPCP 1994: 1-9
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-24 22:47 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:
