In academic year 2012-13, I teach Automated Reasoning (3rd year UG), Computational Complexity (3rd year UG), and Mathematics for Computer Science (1st year UG).
All teaching materials are on DUO (local access only).
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.
Meetings related to Mathematics of Constraint Satisfaction: