Personal profile

Personal profile

Prof. David Cohen does research on the theory of constraint satisfaction. More generally he is interested in the development and analysis of algorithms for improving the effectiveness of industrial
processes, for example, access control, frequency assignment, workflow, and
vehicle routing.

He would welcome applications from prospective PhD students on any aspect of the theory of constraints or valued constraints. In work in any of the following domains:

1) How representation affects efficiency.

2) Which conservative languages are FPT (WSP)

3) Characterising small tractable forbidden patterns

4) Studying the clone lattice and fractional polymorphisms in general

4) Proving the exact complexity of specific CSP languages

5) Considering well know algorithms and how they are affected by particular common changes of representation

Please feel free to contact Prof. Cohen to discuss these topics. Funding is always available for good candidates.


  • Computer science
  • Artificial intelligence
  • Constraint Satisfaction
  • Computational science foundations
  • Algorithms
  • Complexity
  • FPT

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • CP2010

    David Cohen (Chair)

    6 Sept 201010 Sept 2010

    Activity: Participating in or organising an eventParticipation in conference