Guyslain Naves' publications

Figure
Version & licenses
Creative Commons License
Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa: Modules in Robinson Spaces.
submitted, (2022).
pdfarXiv
Guyslain Naves, F Bruce Shepherd: When Do Gomory-Hu Subtrees Exist?
accepted in SIAM Discrete Mathematics, (2022).
pdfarXiv
Guyslain Naves, F Bruce Shepherd, Henry Xia: Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators.
Mathematical Programming, 1 -- 19.
Springer, (2022).
pdfarXivpublisher
Victor Chepoi, Bertrand Estellon, Guyslain Naves:
Discrete & Computational Geometry, 57, 985 -- 1011.
Springer, (2017).
pdfarXivpresentationpublisher
Jérémie Chalopin, Victor Chepoi, Guyslain Naves: Isometric embedding of Busemann surfaces into $L_1$.
Discrete & Computational Geometry, 53, 16 -- 37.
Springer US, (2015).
pdfarXiv
Guyslain Naves, Arnaud Spiwack: Balancing lists: a proof pearl.
In: Interactive Theorem Proving.
(2014).
pdfarXivSources on Github
Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd: Maximum Edge-Disjoint Paths in k-sums of Graphs.
In: ICALP 2013: The 40th International Colloquium on Automata, Languages and Programming, LNCS 7965. Editor: F.V.Fomin et als., 328 -- 339.
Springer, Heidelberg, (2013).
pdfarXivpresentation
Bundit Laekhanukit, Guyslain Naves, Adrian Vetta: Non-redistributive second welfare theorem.
In: Wine 2012: The 8th Workshop on Internet & Network Economics.
(2012).
pdfpresentation
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta: Approximating Rooted Steiner Network.
In: SODA 2012: Symposium On Discrete Algorithms.
(2012).
pdfpresentationHAL: Hyper Articles en Ligne.
Guyslain Naves: The hardness of routing two pairs on one face.
Mathematical Programming, 131, 49 -- 69.
Springer, (2012).
publisherpdfHAL: Hyper Articles en Ligne.
Guyslain Naves: Optimal Routings: tours, flows and paths.
PhD. thesis, Joseph Fourier University, Grenoble, (2010).
pdfpresentationHAL: Hyper Articles en Ligne.
Vincent Jost, Guyslain Naves: The graphs with the max-Mader-flow-min-multiway-cut property.
In: CanaDAM 2011: Canadian Discrete and Algorithmic Mathematics Conference.
(2011).
pdfpresentationHAL: Hyper Articles en Ligne.
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta: Maximum Flows on Disjoint Paths.
In: APPROX 2010: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. , 326 -- 337.
Lecture Notes in Computer Science, (2010).
publisherpdfpresentationHAL: Hyper Articles en Ligne.
Guyslain Naves: On disjoint paths in acyclic planar graphs.
Accepted (Combinatorica), (2010).
pdfpresentationHAL: Hyper Articles en Ligne.webpage
Guyslain Naves, Christophe Weibel: Congestion in planar graphs with demand on faces.
Manuscript, (2010).
pdfHAL: Hyper Articles en Ligne.webpage
Guyslain Naves, András Sebő: Multiflow Feasibility: an annotated tableau.
In: Research Trends in Combinatorial Optimization. Editors:William J. Cook, László Lovász, Jens Vygen., 261 -- 283.
Springer, (2008).
publisherpdfHAL: Hyper Articles en Ligne.webpage
Nadia Brauner, Guyslain Naves: Scheduling chains of operations on a batching machine with disjoint sets of operation compatibility.
Rejected, (2008).
pdfpresentationHAL: Hyper Articles en Ligne.