Gautier Stauffer

According to our database, Gautier Stauffer authored at least 31 papers between 2004 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A Strongly Polynomial-Time Combinatorial Algorithm for the Nucleolus in Convex Games.

Giacomo Maggiorano, Alessandro Sosso, Gautier Stauffer

CoRR, September, 2025

Should sports professionals consider their adversary's strategy? A case study of match play in golf.

Nishad Wajge, Gautier Stauffer

Comput. Stat., April, 2025

2-approximation algorithms for two variants of the static stochastic joint replenishment problem.

Guillaume Massonnet, Gautier Stauffer

Oper. Res. Lett., 2025

2024

How many matchings cover the nodes of a graph?

Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer

Math. Program., January, 2024

2022

Horizontal collaboration in forestry: game theory models and algorithms for trading demands.

Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer

CoRR, 2022

On the facets of stable set polytopes of circular interval graphs.

Gianpaolo Oriolo, Gautier Stauffer

Ann. Oper. Res., 2022

2021

Separation routine and extended formulations for the stable set problem in claw-free graphs.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

Math. Program., 2021

2020

The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing.

Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres

Oper. Res. Lett., 2020

The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective.

Matthieu Guillot, Gautier Stauffer

Eur. J. Oper. Res., 2020

Combining lithography and Directed Self Assembly for the manufacturing of vias: Connections to graph coloring problems, integer programming formulations, and numerical experiments.

Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres

Eur. J. Oper. Res., 2020

2019

DSA-aware multiple patterning for the manufacturing of vias: Connections to graph coloring problems, IP formulations, and numerical experiments.

Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres

CoRR, 2019

2018

Approximation algorithms for <i>k</i>-echelon extensions of the one warehouse multi-retailer problem.

Gautier Stauffer

Math. Methods Oper. Res., 2018

2017

Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints.

Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer

Math. Oper. Res., 2017

2016

Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales.

Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer

Eur. J. Oper. Res., 2016

2014

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

J. ACM, 2014

2013

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.

Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

On the recognition of fuzzy circular interval graphs.

Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer

Discret. Math., 2012

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

On the facets of the stable set polytope of quasi-line graphs.

Gautier Stauffer

Oper. Res. Lett., 2011

Lower bounds for the Chvátal-Gomory rank in the 0/1 cube.

Sebastian Pokutta, Gautier Stauffer

Oper. Res. Lett., 2011

A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem.

Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

An algorithmic decomposition of claw-free graphs leading to an O(n³)-algorithm for the weighted stable set problem.

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

At Play with Combinatorial Optimization, Integer Programming and Polyhedra. (Excursions en Optimisation Combinatoire, Programmation Entiere et Polyedres).

Gautier Stauffer

, 2011

2009

France Telecom workforce scheduling problem: a challenge.

Sebastian Pokutta, Gautier Stauffer

RAIRO Oper. Res., 2009

2008

The p-median polytope of Y-free graphs: An application of the matching theory.

Gautier Stauffer

Oper. Res. Lett., 2008

Clique-circulants and the stable set polytope of fuzzy circular interval graphs.

Gianpaolo Oriolo, Gautier Stauffer

Math. Program., 2008

The stable set polytope of quasi-line graphs.

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura

Comb., 2008

A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs.

Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2005

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.

Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer

Math. Methods Oper. Res., 2004

The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs.

Gautier Stauffer, Thomas M. Liebling

Electron. Notes Discret. Math., 2004