A few words

I am an Associate Professor (Professeur des Universités) at the Grenoble Institute of Technology (Grenoble INP). Before moving to Grenoble, I was assistant professor at the University of Bordeaux on an INRIA Chair of Excellence and prior to that, I was a permanent research staff member at the IBM Zurich Research Lab. I hold an Engineering Degree in Computer Sciences and Applied Mathematics (ISIMA, France) and I did my Ph.D. in Operations Research at the Swiss Institute of Technology in Lausanne (EPFL) under the direction of Professor Thomas M. Liebling. Before joining IBM, I was a post-doc in the department of mathematics at MIT under the supervision of Prof. Michel Goemans. My research is in Combinatorial Optimization, Integer Programming, Polyhedral Combinatorics and their Applications.

Selected publications

Solving the weighted stable set problem in claw-free graphs via decomposition. Y. Faenza, G. Oriolo, G. Stauffer. Journal of the ACM (JACM) 61 (4), 20. 2014. pdf.

Minimum clique cover in claw-free perfect graphs and the weak Edmonds- Johnson property. F. Bonomo, G. Oriolo, C. Snels, G. Stauffer. Proceedings of IPCO, 86-97. 2013.

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. Y. Faenza, G. Oriolo, G. Stauffer. Proceedings of SODA. 2012.

J.-P. Gayon, G. Massonnet, C. Rapine, and G. Stauffer. Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints. to appear in Mathematics of Operations Research. pdf

The stable set polytope of quasi-line graphs. F. Eisenbrand, G. Oriolo, G. Stauffer, P. Ventura. Combinatorica 28 (1), 45-67. 2008. pdf.

Cargese Workshop in Combinatorial Optimization

2016: Discrete geometry and algorithms for integer programming

2015: Fast Algorithms

2014: Extended Formulations II

2013: Submodular Functions

2012: Traveling Salesman Problem

2011: Rounding techniques

2010: Extended Formulations I

Full CV: pdf