Guyslain Naves
Présentation
Last update: September 14, 2015
Publications
Publications
|
|
A simple and optimal algorithm for strict circular seriationSIAM Journal on Mathematics of Data Science, 2023, 5 (1), pp.201-221. ⟨10.1137/22M149534⟩ |
|
|
Packing and Covering with Balls on Busemann SurfacesDiscrete and Computational Geometry, 2017, 57, pp.985 - 1011. ⟨10.1007/s00454-017-9872-0⟩ |
Approximating rooted Steiner networksACM Transactions on Algorithms, 2014, 11 (2), pp.8 |
|
|
|
The hardness of routing two pairs on one faceMathematical Programming, Series A, 2012, 131 (1 - 2), pp.49 - 69. ⟨10.1007/s10107-010-0343-0⟩ |
Une généralisation du problème du cycle Hamiltonien.ROADEF 2009, 2009, pp.229 |
|
Multiflow feasibility: an annotated tableauResearch Trends in Combinatorial Optimization, 2009, pp.261--283. ⟨10.1007/978-3-540-76796-1_12⟩ |
|
|
Balancing Lists: A Proof Pearl5th International Conference, ITP 2014, Jul 2014, Vienna, Austria. pp.437 - 449, ⟨10.1007/978-3-319-08970-6_28⟩ |
|
|
Maximum edge-disjoint paths in k-sums of graphsInternational Colloquium on Automata, Languages, and Programming, Jul 2013, Riga, Latvia |
Non-redistributive second welfare theoremsWINE 2012: The 8th Workshop on Internet & Network Economics, Dec 2012, University of Liverpool, United Kingdom |
|
|
|
Approximating Rooted Steiner NetworkSymposium on Discrete Algorithms (SODA 2012), Jan 2012, Kyoto, Japan |
|
|
Maximum Flows on Disjoint PathsAPPROX-RANDOM, Sep 2010, Barcelona, Spain. pp.326-337, ⟨10.1007/978-3-642-15369-3_25⟩ |
Ordonnancement par batch avec contraintes de compatibilitéROADEF 2008, 9ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, 2008, Clermont-Ferrand, France |
|
Existence de chemins disjoints dans le plan9èmes journées Graphes et Algorithmes, Nov 2007, Paris, France |
Maximum edge-disjoint paths in k-sums of graphsAutomata, Languages, and Programming, Springer Berlin Heidelberg, pp.328--339, 2013 |
|
|
|
Multiflow Feasibility : an Annotated TableauResearch Trends in Combinatorial Optimization, Springer, pp.261-283, 2009 |
|
|
When Do Gomory-Hu Subtrees Exist?2020 |
|
|
Isometric Embedding of Busemann Surfaces into $L_1$2023 |
|
|
Packing and covering with balls on Busemann surfaces2015 |
|
|
The graphs with the max-Mader-flow-min-multiway-cut property2010 |
|
|
On disjoint paths in acyclic planar graphs2010 |
|
|
Congestion in planar graphs with demands on faces2010 |
|
|
Scheduling chains of operations on a batching machine with disjoint sets of operation compatibility2008 |
|
|
Routages optimaux : tours, flots et chemins.Informatique [cs]. Université Joseph-Fourier - Grenoble I, 2010. Français. ⟨NNT : ⟩ |