Research in theoretical computer science
I am broadly interested in theoretical computer science, with a focus on constraint satisfaction problems and parameterized complexity.
My research is in computational complexity, an area that studies possibilities and limitations of efficient computation from a mathematical perspective. More specifically, I work on constraint satisfaction problems – a general class of problems where a global solution needs to satisfy many local constraints (think of solving the Zebra puzzle, or scheduling classes for a university while avoiding time conflicts).
More info about the Zebra puzzle.