Gautier Stauffer

36 papers A* 3B 3Journal 29

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	2-approximation algorithms for two variants of the static stochastic joint replenishment problem. Oper. Res. Lett. Guillaume Massonnet, Gautier Stauffer
2025	J	`jnl`	A Strongly Polynomial-Time Combinatorial Algorithm for the Nucleolus in Convex Games. CoRR Giacomo Maggiorano, Alessandro Sosso, Gautier Stauffer
2025	J	`jnl`	Golf strategy optimization and the "Drive for show, putt for dough" adage. Comput. Stat. Gautier Stauffer, Matthieu Guillot
2025	J	`jnl`	Should sports professionals consider their adversary's strategy? A case study of match play in golf. Comput. Stat. Nishad Wajge, Gautier Stauffer
2024	J	`jnl`	How many matchings cover the nodes of a graph? Math. Program. Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
2022	J	`jnl`	Horizontal collaboration in forestry: game theory models and algorithms for trading demands. CoRR Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer
2022	J	`jnl`	On the facets of stable set polytopes of circular interval graphs. Ann. Oper. Res. Gianpaolo Oriolo, Gautier Stauffer
2021	J	`jnl`	Separation routine and extended formulations for the stable set problem in claw-free graphs. Math. Program. Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2020	J	`jnl`	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. Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres
2020	J	`jnl`	The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective. Eur. J. Oper. Res. Matthieu Guillot, Gautier Stauffer
2020	J	`jnl`	The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing. Oper. Res. Lett. Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres
2019	J	`jnl`	DSA-aware multiple patterning for the manufacturing of vias: Connections to graph coloring problems, IP formulations, and numerical experiments. CoRR Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres
2019	J	`jnl`	The $k$-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing. CoRR Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, Andres J. Torres
2018	J	`jnl`	Approximation algorithms for Math. Methods Oper. Res. Gautier Stauffer
2018	J	`jnl`	How many matchings cover the nodes of a graph? CoRR Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
2017	J	`jnl`	Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. Math. Oper. Res. Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer
2017	J	`jnl`	The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective. CoRR Matthieu Guillot, Gautier Stauffer
2016	J	`jnl`	Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. Eur. J. Oper. Res. Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer
2014	J	`jnl`	Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. J. ACM Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2013	B	`conf`	Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. IPCO Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer
2012	J	`jnl`	On the recognition of fuzzy circular interval graphs. Discret. Math. Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2012	A*	`conf`	Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2011	A*	`conf`	A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem. SODA Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon
2011	A*	`conf`	An algorithmic decomposition of claw-free graphs leading to an O(n SODA Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2011	—	`book`	At Play with Combinatorial Optimization, Integer Programming and Polyhedra. (Excursions en Optimisation Combinatoire, Programmation Entiere et Polyedres). Gautier Stauffer
2011	J	`jnl`	Lower bounds for the Chvátal-Gomory rank in the 0/1 cube. Oper. Res. Lett. Sebastian Pokutta, Gautier Stauffer
2011	J	`jnl`	On the Recognition of Fuzzy Circular Interval Graphs CoRR Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2011	J	`jnl`	On the facets of the stable set polytope of quasi-line graphs. Oper. Res. Lett. Gautier Stauffer
2009	J	`jnl`	France Telecom workforce scheduling problem: a challenge. RAIRO Oper. Res. Sebastian Pokutta, Gautier Stauffer
2008	B	`conf`	A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. IPCO Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2008	J	`jnl`	Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Math. Program. Gianpaolo Oriolo, Gautier Stauffer
2008	J	`jnl`	The p-median polytope of Y-free graphs: An application of the matching theory. Oper. Res. Lett. Gautier Stauffer
2008	J	`jnl`	The stable set polytope of quasi-line graphs. Comb. Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2005	B	`conf`	Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2004	J	`jnl`	On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Math. Methods Oper. Res. Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer
2004	J	`jnl`	The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs. Electron. Notes Discret. Math. Gautier Stauffer, Thomas M. Liebling