Current graduate students
Past graduate students
For prospective students: Possible Thesis Topics
- Complexity, algorithmic, and logical aspects of the
constraint satisfaction and homomorphism problems
- Problems related to counting graph homomorphisms
- Approximation algorithms for counting and weighted
constraint satisfaction problem
- Various aspects of the random Satisfiability and
constraint satisfaction problems