Skip to Main content Skip to Navigation

hal-00402218v1  Journal articles
Cyril GavoilleNicolas Hanusse. On Compact Encoding of Pagenumber $k$ Graphs
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.23-34
hal-00651833v1  Conference papers
Ittai AbrahamCyril Gavoille. On approximate distance labels and routing schemes with affine stretch
$25^$ International Symposium on Distributed Computing (DISC), Sep 2011, Rome, Italy. pp.404-415, ⟨10.1007/978-3-642-24100-0_39⟩
hal-00651825v1  Conference papers
Cyril GavoilleQuentin GodfroyLaurent Viennot. Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners
OPODIS'11 - 15th International Conference on Principles of Distributed Systems, Dec 2011, Toulouse, France. pp.143-158, ⟨10.1007/978-3-642-25873-2_11⟩
hal-00651845v1  Conference papers
Cyril Gavoille. Oracles pour les arbres et les graphes
10 ans du séminaire MaMux - Mathématiques, musique et relations avec d'autres disciplines, May 2011, Paris, France
hal-00651841v1  Journal articles
Youssou DiengCyril Gavoille. Routage compact optimal dans les $(k,r)$-constellations
Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, Lavoisier, 2011, 30 (05/2011), pp.485-513. ⟨10.3166/TSI.30.485-513⟩
hal-00651836v1  Conference papers
Cyril GavoilleSommer Chrisitan. Sparse Spanners vs. Compact Routing
$23^$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Jun 2011, San Jose, United States. pp.225-234, ⟨10.1145/1989493.1989526⟩
hal-00353638v1  Conference papers
Olivier LyCyril Gavoille. Distance Labeling in Hyperbolic Graphs
16th Annual International Symposium on Algorithms and Computation, ISAAC, 2005, France. pp.1071-1081
hal-00155186v1  Conference papers
Pierre FraigniaudCyril GavoilleAdrian KosowskiEmmanuelle LebharZvi Lotker. Universal augmentation schemes for network navigability: overcoming the $\sqrt n$-barrier
nineteenth annual ACM symposium on parallelism and architectures, 2007, San Diego, California, United States. pp.1-7
hal-00656916v1  Conference papers
Cyril Gavoille. Dynamic Algorithms via Forbidden-Set Labeling
First International Workshop on Dynamic Systems (DYNAM), Dec 2011, Toulouse, France
hal-00408228v1  Conference papers
Emilie DiotCyril Gavoille. On the Path Separability of Planar Graphs
EuroComb 2009, Bordeaux, France, Sep 2009, Bordeaux, France. pp.549-552, ⟨10.1016/j.endm.2009.07.091⟩
hal-00408481v1  Conference papers
Youssou DiengCyril Gavoille. On the Tree-Width of Planar Graphs
EuroComb 2009, Bordeaux, France, Sep 2009, Bordeaux, France. pp.593-596, ⟨10.1016/j.endm.2009.07.099⟩
hal-00366615v1  Conference papers
Cyril GavoilleYoussou Dieng. Routage dans les réseaux cellulaires
10ièmes Journées Doctorales en Informatique et Réseaux, Belfort, UTMB, France, février 2009, Feb 2009, Belfort, France. pp.7-12
hal-00367998v1  Conference papers
Cyril GavoillePierre Fraigniaud. Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch
20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Munich, Allemagne, juin 2008, Jun 2008, Munich, Germany. pp.62-69, ⟨10.1145/1378533.1378542⟩
inria-00476151v1  Conference papers
Nicolas BonichonCyril GavoilleNicolas HanusseDavid IlcinkasLjubomir Perkovic. Comment résumer le plan
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
hal-00818445v2  Conference papers
Cyril GavoilleChristian GlacetNicolas HanusseDavid Ilcinkas. Algorithme distribué de routage compact en temps optimal
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.117-120
hal-00507833v3  Preprints, Working Papers, ...
Emilie DiotCyril Gavoille. Path Separability of Graphs
hal-00371154v1  Conference papers
Cyril Gavoille. Localized Data Structures (Keynote Talk)
2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), PODC, Portland, Oregon, Etats-Unis, août 2007, Aug 2007, Portland, United States
hal-00371401v1  Conference papers
Ittai AbrahamCyril GavoilleDahlia MalkhiUdi Wieder. Strong-Diameter Decompositions of Minor Free Graphs
19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Diego, Californie, Etats-Unis, 2007, Jun 2007, San Diego, United States. pp.16-24, ⟨10.1145/1248377.1248381⟩
hal-00368036v1  Conference papers
Cyril GavoilleYoussou Dieng. La structure des graphes sans mineur K 2,4
10ièmes Journées Graphes et Algorithmes, INRIA Sophia Antipolis, Nice, novembre 2008, Nov 2008, France
hal-00369624v1  Conference papers
Cyril GavoilleArnaud Labourel. Schéma relationnel distribué pour les arbres
9èmes Journées Graphes et Algorithmes, Paris, novembre 2007, Nov 2007, Paris, France. pp.19
hal-00369657v1  Conference papers
Cyril GavoilleNicolas BonichonArnaud Labourel. Short Labels by Traversal and Jumping
6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, mars 2007, Mar 2007, Prague, Czech Republic. pp.153-160, ⟨10.1016/j.endm.2007.01.022⟩
hal-00369646v1  Conference papers
Cyril GavoilleArnaud Labourel. Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
15th Annual European Symposium on Algorithms (ESA), octobre 2007, Eilat, Israël, Oct 2007, Eilat, Israel. pp.582-593
hal-00420405v1  Conference papers
Ittai AbrahamCyril GavoilleDahlia Malkhi. On Space-Stretch Trade-Offs: Upper Bounds
Symposium on Parallel Algorithms and Architectures (SPAA), 2006, Cambridge, Massachusetts, United States. pp.207-216, ⟨10.1145/1148109.1148144⟩