1. Exponential approximation schemata for some network design problems;Boria;Cahier du Lamsade,2011
2. M. Bougeret, Systèmes interactifs pour la résolution de problèmes complexes, PhD Thesis, INP Grenoble, 2010.
3. Efficient approximation of combinatorial problems by moderately exponential algorithms;Bourgeois;Algorithms and Data Structures,2009
4. Tighter bound for MULTIFIT scheduling on uniform processors;Chen;Discrete Applied Mathematics,1991
5. Approximating max sat by moderately exponential algorithms;Escoffier;Cahier du Lamsade,2011