Guyslain Naves

Orcid: 0000-0001-5460-9995

According to our database1, Guyslain Naves authored at least 19 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Modules in Robinson Spaces.
SIAM J. Discret. Math., March, 2024

2023
Integer Multiflows in Acyclic Planar Digraphs.
Comb., October, 2023

A Simple and Optimal Algorithm for Strict Circular Seriation.
SIAM J. Math. Data Sci., March, 2023

Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators.
Math. Program., February, 2023

Modules and PQ-trees in Robinson spaces.
CoRR, 2023

2022
When Do Gomory-Hu Subtrees Exist?
SIAM J. Discret. Math., 2022

2017
Packing and Covering with Balls on Busemann Surfaces.
Discret. Comput. Geom., 2017

2015
Isometric Embedding of Busemann Surfaces into L<sub>1</sub>.
Discret. Comput. Geom., 2015

2014
Approximating Rooted Steiner Networks.
ACM Trans. Algorithms, 2014

Balancing Lists: A Proof Pearl.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2013
Maximum Edge-Disjoint Paths in k-Sums of Graphs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
The hardness of routing two pairs on one face.
Math. Program., 2012

Non-redistributive Second Welfare Theorems.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011
The graphs with the max-Mader-flow-min-multiway-cut property
CoRR, 2011

2010
Routages optimaux : tours, flots et chemins. (Optimal Routings: Tours, Flows and Paths).
PhD thesis, 2010

Congestion in planar graphs with demands on faces
CoRR, 2010

On disjoint paths in acyclic planar graphs
CoRR, 2010

Maximum Flows on Disjoint Paths.
Proceedings of the Approximation, 2010

2008
Multiflow Feasibility: An Annotated Tableau.
Proceedings of the Research Trends in Combinatorial Optimization, 2008


  Loading...