Research interests

     

Complexity and approximation algorithms for combinatorial optimization problems (structure in approximation classes, standard and differential approximation)

  
Worst case complexity of exact algorithms , moderately exponential time approximation  

Algorithms for dynamic instances (reoptimization, on-line algorithms, probabilistic combinatorial optimization, Data Stream)

  
Algorithmic for Decision Theory (robustness for optimization problems, combinatorial social choice)  
     

Research activities

     
Projects :
• Project COMSOC (Computational Social Choice), funded by ANR
• Project TODO (Time versus Optimality in Discrete Optimization), funded by ANR
• Project COCA (Combinatorial Optimization with Competing Agents), funded by ANR
• Project CREPE (Complexité et Résolution Exacte ou approchée de problèmes de Partage Équitable), funded by GDR RO
• AGAPE (Algorithmique à garanties de performances) research group from GDR RO.		  
Co-advisor (with V. Paschos) of the PhD Thesis of Nicolas Bourgeois entitled "Approximation efficiente de problèmes difficiles d'optimisation combinatoire"  

Invited researcher:
- by Giorgio Ausiello, DIS, Università La Sapienza, Rome. From 15/09/2005 to 15/12/2005, and from 23/06/2007 to 07/07/2007
- by Peter L. Hammer, RUTCOR, Rutgers University, USA, one week in april 2005
- by Fred Roberts, DIMACS, Rutgers University, USA, from 15/11/2004 to 15/012005

  
Membre organizing committees:
- of the "Journées Franciliennes de Recherche Opérationnelle" (http://www-desir.lip6.fr/~fouilhoux/JFRO/) from Septembre 2006
- of the workshop "computer science and decision theory", Paris, 28-30 octobre 2004
  
Membre of the program committee of conferences Majecstic 2003 (Marseille, France) and 2004 (Calais, France)  
Referee for journals (ACM TALG, Algorithmica, TCS, DAM, Annals of OR, ...) and conferences (ISAAC, ESA, WG, WAOA, MFCS, WEA, FCT,...)