Identifiants chercheur

Nombre de documents

21

List of my publications recorded in HAL


Last update: September 14, 2015

 

http://assert-false.net/guyslain

 

 


Article dans une revue6 documents

  • Jérémie Chalopin, Victor Chepoi, Guyslain Naves. Isometric Embedding of Busemann Surfaces into L₁. Discrete and Computational Geometry, Springer Verlag, 2015, 53 (1), pp.16--37. 〈10.1007/s00454-014-9643-0〉. 〈hal-01198886〉
  • Jérémie Chalopin, Victor Chepoi, Guyslain Naves. Isometric Embedding of Busemann Surfaces into L\₁. Discrete and Computational Geometry, Springer Verlag, 2015, 53 (1), pp.16--37. 〈hal-01198832〉
  • Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta. Approximating rooted Steiner networks. ACM Transactions on Algorithms, Association for Computing Machinery, 2014, 11 (2), pp.8. 〈hal-01198833〉
  • Guyslain Naves. The hardness of routing two pairs on one face. Mathematical Programming, Series A, Springer, 2012, 131 (1 - 2), pp.49 - 69. 〈10.1007/s10107-010-0343-0〉. 〈hal-00313944v2〉
  • Guyslain Naves, Andras Sebo. Multiflow feasibility: an annotated tableau. Research Trends in Combinatorial Optimization, 2009, pp.261--283. 〈hal-01198835〉
  • Vincent Jost, Guyslain Naves. Une généralisation du problème du cycle Hamiltonien.. ROADEF 2009, 2009, pp.229. 〈hal-01198836〉

Communication dans un congrès7 documents

  • Guyslain Naves, Arnaud Spiwack. Balancing Lists: A Proof Pearl. 5th International Conference, ITP 2014, Jul 2014, Vienna, Austria. 8558, pp.437 - 449, 2014, Interactive Theorem Proving. 〈10.1007/978-3-319-08970-6_28〉. 〈hal-01097937〉
  • Chekuri Chandra, Guyslain Naves, Shepherd Bruce. Maximum edge-disjoint paths in k-sums of graphs. International Colloquium on Automata, Languages, and Programming, Jul 2013, Riga, Latvia. 〈hal-01198798〉
  • Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta. Approximating Rooted Steiner Network. Symposium on Discrete Algorithms (SODA 2012), Jan 2012, Kyoto, Japan. 〈hal-00709994〉
  • Bundit Laekhanukit, Guyslain Naves, Adrian Vetta. Non-redistributive second welfare theorems. WINE 2012: The 8th Workshop on Internet & Network Economics, Dec 2012, University of Liverpool, United Kingdom. Internet and Network Economics, 〈Springer Berlin Heidelberg〉. 〈hal-01198790〉
  • Guyslain Naves, Nicolas Sonnerat, Adrian Vetta. Maximum Flows on Disjoint Paths. Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim. APPROX-RANDOM, Sep 2010, Barcelona, Spain. Springer, 6302, pp.326-337, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-15369-3_25〉. 〈hal-00554467〉
  • Guyslain Naves, Nadia Brauner. 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. 〈hal-00262106〉
  • Guyslain Naves. Existence de chemins disjoints dans le plan. 9èmes journées Graphes et Algorithmes, Nov 2007, Paris, France. 2007. 〈hal-00379235〉

Chapitre d'ouvrage2 documents

  • Chandra Chekuri, Guyslain Naves, F Bruce Shepherd. Maximum edge-disjoint paths in k-sums of graphs. Automata, Languages, and Programming, Springer Berlin Heidelberg, pp.328--339, 2013. 〈hal-01198834〉
  • Guyslain Naves, Andras Sebo. Multiflow Feasibility : an Annotated Tableau. Research Trends in Combinatorial Optimization, Springer, pp.261-283, 2009. 〈hal-00313948〉

Pré-publication, Document de travail5 documents

  • Victor Chepoi, Bertrand Estellon, Guyslain Naves. Packing and covering with balls on Busemann surfaces. 2015. 〈hal-01198820〉
  • Guyslain Naves, Vincent Jost. The graphs with the max-Mader-flow-min-multiway-cut property. 2010. 〈hal-00554468〉
  • Guyslain Naves, Christophe Weibel. Congestion in planar graphs with demands on faces. 2010. 〈hal-00510747〉
  • Guyslain Naves. On disjoint paths in acyclic planar graphs. 2010. 〈hal-00510749〉
  • Nadia Brauner, Guyslain Naves. Scheduling chains of operations on a batching machine with disjoint sets of operation compatibility. OSP. 2008. 〈hal-00264402〉

Thèse1 document

  • Guyslain Naves. Routages optimaux : tours, flots et chemins.. Informatique [cs]. Université Joseph-Fourier - Grenoble I, 2010. Français. 〈tel-00465585〉