The stable set polytope of quasi-line graphs F Eisenbrand, G Oriolo, G Stauffer, P Ventura Combinatorica 28, 45-67, 2008 | 75 | 2008 |

An algorithmic decomposition of claw-free graphs leading to an *O*(*n*^{3})-algorithm for the weighted stable set problemY Faenza, G Oriolo, G Stauffer Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 60* | 2011 |

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs TM Liebling, G Oriolo, B Spille, G Stauffer Mathematical Methods of Operations Research 59, 25-35, 2004 | 47 | 2004 |

A new algorithm for the maximum weighted stable set problem in claw-free graphs G Oriolo, U Pietropaoli, G Stauffer Integer Programming and Combinatorial Optimization: 13th International …, 2008 | 44 | 2008 |

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), 1-41, 2014 | 42 | 2014 |

On the stable set polytope of claw-free graphs G Stauffer EPFL, 2005 | 34 | 2005 |

Circular ones matrices and the stable set polytope of quasi-line graphs F Eisenbrand, G Oriolo, G Stauffer, P Ventura Integer Programming and Combinatorial Optimization: 11th International IPCO …, 2005 | 30 | 2005 |

The stochastic shortest path problem: a polyhedral combinatorics perspective M Guillot, G Stauffer European Journal of Operational Research 285 (1), 148-158, 2020 | 24 | 2020 |

A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem G Stauffer, G Massonnet, C Rapine, JP Gayon Proceedings of the twenty-second annual ACM-SIAM symposium on discrete …, 2011 | 21 | 2011 |

Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales JP Gayon, G Massonnet, C Rapine, G Stauffer European Journal of Operational Research 250 (1), 155-163, 2016 | 19 | 2016 |

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs Y Faenza, G Oriolo, G Stauffer Proceedings of the twenty-third annual ACM-SIAM symposium on discrete …, 2012 | 16* | 2012 |

Lower bounds for the Chvátal–Gomory rank in the 0/1 cube S Pokutta, G Stauffer Operations Research Letters 39 (3), 200-203, 2011 | 16 | 2011 |

On the recognition of fuzzy circular interval graphs G Oriolo, U Pietropaoli, G Stauffer Discrete Mathematics 312 (8), 1426-1435, 2012 | 14 | 2012 |

Using the economical order quantity formula for inventory control in one‐warehouse multiretailer systems G Stauffer Naval Research Logistics (NRL) 59 (3‐4), 285-297, 2012 | 13* | 2012 |

Clique-circulants and the stable set polytope of fuzzy circular interval graphs G Oriolo, G Stauffer Mathematical programming 115 (2), 291-317, 2008 | 10 | 2008 |

Fast approximation algorithms for the One-Warehouse Multi-Retailer problem under general cost structures and capacity constraints JP Gayon, G Massonnet, C Rapine, G Stauffer Mathematics of Operations Research 42 (3), 854-875, 2017 | 7 | 2017 |

France Telecom workforce scheduling problem: A challenge S Pokutta, G Stauffer RAIRO-Operations Research-Recherche Opérationnelle 43 (4), 375-386, 2009 | 7 | 2009 |

The p-median polytope of Y-free graphs: an application of the matching theory G Stauffer Operations research letters 36 (3), 351-354, 2008 | 7 | 2008 |

Stable Sets in Claw-free Graphs: a journey through algorithms and polytopes G Oriolo, G Stauffer, P Ventura Progress in Combinatorial Optimization., 2011 | 6 | 2011 |

An algorithmic decomposition of claw-free graphs leading to an O (n3)-algorithm for the weighted independent set problem, SODA 2011: 630-646 Y Faenza, G Oriolo, G Stauffer Journal of the ACM 61 (4), 2014 | 5 | 2014 |