Gautier Stauffer
Orcid: 0000-0002-2809-8447
According to our database1,
Gautier Stauffer
authored at least 28 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
1
2
3
4
5
6
1
2
1
3
1
1
1
1
1
1
2
1
3
2
1
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2022
Horizontal collaboration in forestry: game theory models and algorithms for trading demands.
CoRR, 2022
Ann. Oper. Res., 2022
2021
Separation routine and extended formulations for the stable set problem in claw-free graphs.
Math. Program., 2021
2020
The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing.
Oper. Res. Lett., 2020
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.
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.
CoRR, 2019
2018
Approximation algorithms for <i>k</i>-echelon extensions of the one warehouse multi-retailer problem.
Math. Methods Oper. Res., 2018
2017
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints.
Math. Oper. Res., 2017
2016
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales.
Eur. J. Oper. Res., 2016
2014
J. ACM, 2014
2013
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
Oper. Res. Lett., 2011
A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem.
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<sup>3</sup>)-algorithm for the weighted stable set problem.
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).
, 2011
2009
2008
Oper. Res. Lett., 2008
Math. Program., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2005
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.
Math. Methods Oper. Res., 2004
The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs.
Electron. Notes Discret. Math., 2004