I am Maitre de Conférences (Associate professor) in the University of Versailles Saint-Quentin in DAVID laboratory. I am head of the ALMOST team (algorithm and stochastic models).
Before that, I was:
For two years, part time in the team BAAM of the LIGM.
For a year in the team RO of LIP6.
ATER in Paris-Sud 11 University in the ALGO team.
Postdoctoral researcher at University of Toronto, Theory group.
Doing my Phd thesis under the direction of Arnaud Durand in the Equipe de Logique Mathématique, Paris 7.
Some Research Interests
Algotihmic and complexity of enumeration problems.
Algorithms for graphs, matroids, cheminformatics, networks, logistic ...
Algorithmic game theory.
Polynomials (sparse or given by circuits), their monomials, roots, degree ...
Current and past students
Phd students:
Chloé Godet : Cycles in graphs and molecular similarity.
Noé Demange : path generation for the synthesis of molecular cages.
Jules Andretti : Machine learning and metaoptimization, hybrid approach for logistic problems.
Werner Mérian : Descriptive complexity of enumeration problem.
Farid Najar. Learning and optimization for logistic.
Maël Guiraud on optimization problems for sending periodic packets over a network. In collaboration with Nokia Bell-Labs.
Xavier Badin de Montjoye on strategy improvement algorithms for simple stochastic games.
Master students/internships:
Tristan Klein: fixed point in fixed dimension.
Joël Charles-Rebuffe: scheduling of periodic tasks.