Gautier Stauffer

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 14

Top Topics

Integrated Circuit

Top Venues

Eur. J. Oper. Res.

Oper. Res. Lett.

Publications

Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
How many matchings cover the nodes of a graph? Math. Program. 203 (1) (2024)
Gianpaolo Oriolo, Gautier Stauffer
On the facets of stable set polytopes of circular interval graphs. Ann. Oper. Res. 312 (2) (2022)
Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer
Horizontal collaboration in forestry: game theory models and algorithms for trading demands. CoRR (2022)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Separation routine and extended formulations for the stable set problem in claw-free graphs. Math. Program. 188 (1) (2021)
Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres
Combining lithography and Directed Self Assembly for the manufacturing of vias: Connections to graph coloring problems, integer programming formulations, and numerical experiments. Eur. J. Oper. Res. 280 (2) (2020)
Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres
The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing. Oper. Res. Lett. 48 (5) (2020)
Matthieu Guillot, Gautier Stauffer
The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective. Eur. J. Oper. Res. 285 (1) (2020)
Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, Andres J. Torres
The $k$-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing. CoRR (2019)
Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres
DSA-aware multiple patterning for the manufacturing of vias: Connections to graph coloring problems, IP formulations, and numerical experiments. CoRR (2019)
Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
How many matchings cover the nodes of a graph? CoRR (2018)
Gautier Stauffer
-echelon extensions of the one warehouse multi-retailer problem. Math. Methods Oper. Res. 88 (3) (2018)
Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. Math. Oper. Res. 42 (3) (2017)
Matthieu Guillot, Gautier Stauffer
The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective. CoRR (2017)
Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. Eur. J. Oper. Res. 250 (1) (2016)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. J. ACM 61 (4) (2014)
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. IPCO (2013)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA (2012)
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
On the recognition of fuzzy circular interval graphs. Discret. Math. 312 (8) (2012)
Sebastian Pokutta, Gautier Stauffer
Lower bounds for the Chvátal-Gomory rank in the 0/1 cube. Oper. Res. Lett. 39 (3) (2011)
Gautier Stauffer
On the facets of the stable set polytope of quasi-line graphs. Oper. Res. Lett. 39 (3) (2011)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
)-algorithm for the weighted stable set problem. SODA (2011)
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
On the Recognition of Fuzzy Circular Interval Graphs CoRR (2011)
Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon
A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem. SODA (2011)
Sebastian Pokutta, Gautier Stauffer
France Telecom workforce scheduling problem: a challenge. RAIRO Oper. Res. 43 (4) (2009)
Gianpaolo Oriolo, Gautier Stauffer
Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Math. Program. 115 (2) (2008)
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
The stable set polytope of quasi-line graphs. Comb. 28 (1) (2008)
Gautier Stauffer
The p-median polytope of Y-free graphs: An application of the matching theory. Oper. Res. Lett. 36 (3) (2008)
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. IPCO (2008)
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO (2005)
Gautier Stauffer, Thomas M. Liebling
The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs. Electron. Notes Discret. Math. 18 (2004)
Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Math. Methods Oper. Res. 59 (1) (2004)