Guyslain Naves' publications

Basile Couëtoux, Bastien Gastaldi, Guyslain Naves: The steady-states of splitter networks.
(2024).

Mikhaël Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa: A simple and optimal algorithm for strict circular seriation.
SIAM Journal on Mathematics of Data Science, 5, 201 -- 221.
Society for Industrial and Applied Mathematics University City, Philadelphia, (2023).

Mikhaël Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa: Modules and PQ-trees in Robinson spaces.
(2023).

Mikhaël Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa: Modules in Robinson Spaces.
SIAM Journal on Discrete Mathematics, 38, 190 -- 224.
(2024).

Mikhaël Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa: Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities.
Journal of Classification, 1 -- 25.
Springer US New York, (2023).

Guyslain Naves, F. Bruce Shepherd: When Do Gomory-Hu Subtrees Exist?
SIAM Journal on Discrete Mathematics, 36, 1567 -- 1585.
(2022).

Guyslain Naves, F. Bruce Shepherd, Henry Xia: Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators.
Mathematical Programming, 197, 1049 -- 1067.
(2023).

Victor Chepoi, Bertrand Estellon, Guyslain Naves: Packing and covering with balls on Busemann surfaces.
Discrete & Computational Geometry, 57, 985 -- 1011.
Springer US, (2017).

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).

Guyslain Naves, Arnaud Spiwack: Balancing lists: a proof pearl.
In: Interactive Theorem Proving.
(2014).

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).

Bundit Laekhanukit, Guyslain Naves, Adrian Vetta: Non-redistributive second welfare theorem.
In: Wine 2012: The 8th Workshop on Internet & Network Economics.
(2012).

Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta: Approximating Rooted Steiner Network.
In: SODA 2012: Symposium On Discrete Algorithms.
(2012).

Guyslain Naves: The hardness of routing two pairs on one face.
Mathematical Programming, 131, 49 -- 69.
Springer, (2012).

Guyslain Naves: Optimal Routings: tours, flows and paths.
PhD. thesis, Joseph Fourier University, Grenoble, (2010).

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).

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).

Guyslain Naves: Integer multiflows in acyclic planar graphs.
Combinatorica, 43, 1031 -- 1043.
(2023).

Guyslain Naves, Christophe Weibel: Congestion in planar graphs with demand on faces.
Manuscript, (2010).

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).

Nadia Brauner, Guyslain Naves: Scheduling chains of operations on a batching machine with disjoint sets of operation compatibility.
Rejected, (2008).