In academic year 2018-19, I teach Mathematics for Computer Science (L1), Algorithms and Data Structures (L1), Complexity and Approximability (L3), and Advanced Topics in Complexity (L4).
My research interests are in the study of mathematical and algorithmic aspects of the constraint satisfaction problem (CSP), often motivated by classification questions about the computational complexity of the CSP.
The most striking feature of this research direction is that, despite computational aspects being its primary motivation, it influences and is influenced by many branches of mathematics, including universal algebra and clone theory (which was my main research interest prior to 2000), lattice theory and semigroup theory, graph theory and combinatorics, logic and finite model theory, group theory and classical model theory, mathematical programming and theory of submodular functions.
Publications Tutorial videos
Meetings related to Mathematics of Constraint Satisfaction: