default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGautier Stauffer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]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): 271-284 (2024)- 2022
- [j18]Gianpaolo Oriolo, Gautier Stauffer:
On the facets of stable set polytopes of circular interval graphs. Ann. Oper. Res. 312(2): 1007-1029 (2022) - [i6]Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer:
Horizontal collaboration in forestry: game theory models and algorithms for trading demands. CoRR abs/2211.04105 (2022) - 2021
- [j17]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separation routine and extended formulations for the stable set problem in claw-free graphs. Math. Program. 188(1): 53-84 (2021) - 2020
- [j16]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): 453-468 (2020) - [j15]Matthieu Guillot, Gautier Stauffer:
The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective. Eur. J. Oper. Res. 285(1): 148-158 (2020) - [j14]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): 652-657 (2020)
2010 – 2019
- 2019
- [i5]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 abs/1902.04145 (2019) - [i4]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 abs/1904.11805 (2019) - 2018
- [j13]Gautier Stauffer:
Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem. Math. Methods Oper. Res. 88(3): 445-473 (2018) - [i3]Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer:
How many matchings cover the nodes of a graph? CoRR abs/1811.07327 (2018) - 2017
- [j12]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): 854-875 (2017) - [i2]Matthieu Guillot, Gautier Stauffer:
The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective. CoRR abs/1702.03186 (2017) - 2016
- [j11]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): 155-163 (2016) - 2014
- [j10]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. J. ACM 61(4): 20:1-20:41 (2014) - 2013
- [c6]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer:
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. IPCO 2013: 86-97 - 2012
- [j9]Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
On the recognition of fuzzy circular interval graphs. Discret. Math. 312(8): 1426-1435 (2012) - [c5]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA 2012: 1298-1308 - 2011
- [b1]Gautier Stauffer:
At Play with Combinatorial Optimization, Integer Programming and Polyhedra. (Excursions en Optimisation Combinatoire, Programmation Entiere et Polyedres). University of Bordeaux, France, 2011 - [j8]Sebastian Pokutta, Gautier Stauffer:
Lower bounds for the Chvátal-Gomory rank in the 0/1 cube. Oper. Res. Lett. 39(3): 200-203 (2011) - [j7]Gautier Stauffer:
On the facets of the stable set polytope of quasi-line graphs. Oper. Res. Lett. 39(3): 208-212 (2011) - [c4]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: 67-79 - [c3]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem. SODA 2011: 630-646 - [i1]Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
On the Recognition of Fuzzy Circular Interval Graphs. CoRR abs/1104.2251 (2011)
2000 – 2009
- 2009
- [j6]Sebastian Pokutta, Gautier Stauffer:
France Telecom workforce scheduling problem: a challenge. RAIRO Oper. Res. 43(4): 375-386 (2009) - 2008
- [j5]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
The stable set polytope of quasi-line graphs. Comb. 28(1): 45-67 (2008) - [j4]Gianpaolo Oriolo, Gautier Stauffer:
Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Math. Program. 115(2): 291-317 (2008) - [j3]Gautier Stauffer:
The p-median polytope of Y-free graphs: An application of the matching theory. Oper. Res. Lett. 36(3): 351-354 (2008) - [c2]Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer:
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. IPCO 2008: 77-96 - 2005
- [c1]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO 2005: 291-305 - 2004
- [j2]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: 213-218 (2004) - [j1]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): 25-35 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
