Manuel Bodirsky
I am Chargé de Recherche (CR1, a permanent research position) of the CNRS at the Laboratoire d'Informatique de l'École Polytechnique (LIX), in the Algorithms and Complexity Team.
| Office |
École Polytechnique, Laboratoire d'Informatique de l'École Polytechnique (LIX) Bâtiment Turing, bureau 2014 1 rue Honoré d'Estienne d'Orves, Campus de l'École Polytechnique, 91120 Palaiseau, France. Bâtiment 24 sur ce plan |
|---|---|
| Phone | +33 1 77 57 80 50 |
| bodirsky@lix.polytechnique.fr | |
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 computational linguistics and artificial intelligence. 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.
- Publications
- Leading the ERC starting project CSP-Complexity.
- Recent teaching: the MPRI course Constraint Satisfaction: Algorithms and Complexity
- Website of our seminar: Le séminaire d'algorithmique et de complexité du plateau de Saclay.
- Looking forward to:
- Trimester Program on Universality and Homogeneity at the Hausdorff Research Institute for Mathematics (HIM) in Bonn, Fall 2013
- Program Committee for the Special Track on SAT and CSP Technologies at the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), November 4-6 2013, Washington DC, USA
- Algebraic and Model Theoretical Methods in Constraint Satisfaction, Banff International Research Station, Nov 23 - Nov 28, 2014.
- Personal
- CV: english, français.