Manuel Bodirsky

Manuel Bodirsky

Researcher of the CNRS at the Laboratoire d'Informatique de l'École Polytechnique (LIX), in the Algorithms and Complexity Team.

Since August 2014: Détachement for a professor position at TU Dresden

I am a researcher in theoretical computer science. My primary research topic are constraint satisfaction problems, where I am interested in algorithms, systematic complexity results, and applications of constraint satisfaction. In particular, I work on the extension of the theory about constraint satisfaction problems over finite domains to infinite domains, and related model theory, universal algebra, and Ramsey theory. In the past, I have also worked in enumerative combinatorics, in particular for (labelled and unlabeled) planar structures.


last modified 03/14 (Manuel Bodirsky)