Professor David Cohen

  1. 2013
  2. Published

    Variable Elimination in Binary CSP via Forbidden Patterns

    Cohen, D., Cooper, M. C., Escamocher, G. & Zivný, S., 2013.

    Research output: Contribution to conferencePaperpeer-review

  3. 2012
  4. Published

    The tractability of CSP classes defined by forbidden patterns

    Cohen, D. A., Cooper, M. C., Creed, P., Marx, D. & Salamon, A. Z., Sep 2012, In: Journal of Artificial Intelligence Research. 45, p. 47-78 3651.

    Research output: Contribution to journalArticlepeer-review

  5. 2011
  6. Published

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

    Cohen, D. A., Creed, P., Jeavons, P. G. & Živný, S., 2011, Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer, p. 231-242 (Lecture Notes in Computer Science; vol. 6907).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  7. Published

    On guaranteeing polynomially-bounded search tree size

    Cohen, D., Cooper, M., Green, M. J. & Marx, D., 2011.

    Research output: Contribution to conferencePaperpeer-review

  8. 2009
  9. Published

    The expressive power of binary submodular functions

    Zivný, S., Cohen, D. A. & Jeavons, P. G., 2009, In: Discrete Applied Mathematics. 157, 15, p. 3347-3358 12 p.

    Research output: Contribution to journalArticlepeer-review

  10. Published

    The Expressive Power of Binary Submodular Functions

    Zivný, S., Cohen, D. A. & Jeavons, P. G., 2009, MFCS 2009. p. 744-757

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  11. 2008
  12. Published

    The expressive power of valued constraints: Hierarchies and collapses

    Cohen, D. A., Jeavons, P. G. & Živný, S., 6 Dec 2008, In: Theoretical Computer Science. 409, 1, p. 137-153 17 p.

    Research output: Contribution to journalArticlepeer-review

  13. Published

    A unified theory of structural tractability for constraint satisfaction problems

    Cohen, D., Jeavons, P. & Gyssens, M., Aug 2008, In: Journal of Computer and System Sciences. 74, 5, p. 721-743 23 p.

    Research output: Contribution to journalArticlepeer-review

  14. Published

    Domain permutation reduction for constraint satisfaction problems

    Green, M. J. & Cohen, D. A., May 2008, In: Artificial Intelligence. 172, 8-9, p. 1094-1118 25 p.

    Research output: Contribution to journalArticlepeer-review

  15. Published

    Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms

    Cohen, D., Cooper, M. & Jeavons, P., 2008, In: Theoretical Computer Science. 401, 1-3, p. 36-51 16 p.

    Research output: Contribution to journalArticlepeer-review