default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuyslain Naves
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities. J. Classif. 41(3): 455-479 (2024)- [j9]Mikhael Carmona, Victor Chepoi, Guyslain Naves
, Pascal Préa:
Modules in Robinson Spaces. SIAM J. Discret. Math. 38(1): 190-224 (2024) - [c8]Basile Couëtoux, Bastien Gastaldi, Guyslain Naves:
The Steady-States of Splitter Networks. FUN 2024: 9:1-9:14 - [i14]Basile Couëtoux, Bastien Gastaldi, Guyslain Naves:
The steady-states of splitter networks. CoRR abs/2404.05472 (2024) - 2023
- [j8]Guyslain Naves:
Integer Multiflows in Acyclic Planar Digraphs. Comb. 43(5): 1031-1043 (2023) - [j7]Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. Math. Program. 197(2): 1049-1067 (2023) - [j6]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
A Simple and Optimal Algorithm for Strict Circular Seriation. SIAM J. Math. Data Sci. 5(1): 201-221 (2023) - [i13]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules and PQ-trees in Robinson spaces. CoRR abs/2306.08800 (2023) - 2022
- [j5]Guyslain Naves, F. Bruce Shepherd:
When Do Gomory-Hu Subtrees Exist? SIAM J. Discret. Math. 36(3): 1567-1585 (2022) - [i12]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules in Robinson Spaces. CoRR abs/2203.12386 (2022) - [i11]Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
A simple and optimal algorithm for strict circular seriation. CoRR abs/2205.04694 (2022) - 2021
- [c7]Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. IPCO 2021: 326-339 - 2020
- [i10]Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. CoRR abs/2007.10537 (2020)
2010 – 2019
- 2018
- [i9]Guyslain Naves, F. Bruce Shepherd:
When Do Gomory-Hu Subtrees Exist? CoRR abs/1807.07331 (2018) - 2017
- [j4]Victor Chepoi, Bertrand Estellon, Guyslain Naves:
Packing and Covering with Balls on Busemann Surfaces. Discret. Comput. Geom. 57(4): 985-1011 (2017) - 2015
- [j3]Jérémie Chalopin, Victor Chepoi, Guyslain Naves:
Isometric Embedding of Busemann Surfaces into L1. Discret. Comput. Geom. 53(1): 16-37 (2015) - [i8]Victor Chepoi, Bertrand Estellon, Guyslain Naves:
Packing and covering with balls on Busemann surfaces. CoRR abs/1508.00778 (2015) - 2014
- [j2]Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating Rooted Steiner Networks. ACM Trans. Algorithms 11(2): 8:1-8:22 (2014) - [c6]Guyslain Naves, Arnaud Spiwack:
Balancing Lists: A Proof Pearl. ITP 2014: 437-449 - [i7]Guyslain Naves, Arnaud Spiwack:
Balancing lists: a proof pearl. CoRR abs/1401.7886 (2014) - 2013
- [c5]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in k-Sums of Graphs. ICALP (1) 2013: 328-339 - [i6]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in $k$-sums of Graphs. CoRR abs/1303.4897 (2013) - [i5]Jérémie Chalopin, Victor Chepoi, Guyslain Naves:
Isometric embedding of Busemann surfaces into L1. CoRR abs/1308.3181 (2013) - 2012
- [j1]Guyslain Naves:
The hardness of routing two pairs on one face. Math. Program. 131(1-2): 49-69 (2012) - [c4]Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating rooted Steiner networks. SODA 2012: 1499-1511 - [c3]Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Non-redistributive Second Welfare Theorems. WINE 2012: 227-243 - 2011
- [i4]Guyslain Naves, Vincent Jost:
The graphs with the max-Mader-flow-min-multiway-cut property. CoRR abs/1101.2061 (2011) - 2010
- [b1]Guyslain Naves:
Routages optimaux : tours, flots et chemins. (Optimal Routings: Tours, Flows and Paths). Joseph Fourier University, Grenoble, France, 2010 - [c2]Guyslain Naves, Nicolas Sonnerat, Adrian Vetta:
Maximum Flows on Disjoint Paths. APPROX-RANDOM 2010: 326-337 - [i3]Guyslain Naves:
On disjoint paths in acyclic planar graphs. CoRR abs/1008.3652 (2010) - [i2]Guyslain Naves, Christophe Weibel:
Congestion in planar graphs with demands on faces. CoRR abs/1008.3653 (2010)
2000 – 2009
- 2009
- [i1]Guyslain Naves:
The hardness of routing two pairs on one face. CoRR abs/0911.3024 (2009) - 2008
- [c1]Guyslain Naves, András Sebö:
Multiflow Feasibility: An Annotated Tableau. Bonn Workshop of Combinatorial Optimization 2008: 261-283
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 2025-01-09 13:17 CET 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:
