Cyril Gavoille

163 papers A* 24A 22B 35C 2Misc 2Journal 70Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	An Improved Bound for Plane Covering Paths. ESA Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous
2025	J	`jnl`	An Improved Bound for Plane Covering Paths. CoRR Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous
2025	J	`jnl`	Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs. CoRR Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025	J	`jnl`	Distributed Freeze Tag: a Sustainable Solution to Discover and Wake-up a Robot Swarm. CoRR Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Taïssir Marcé
2025	A*	`conf`	Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm. PODC Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Taïssir Marcé
2025	B	`conf`	Isometric-Universal Graphs for Trees. MFCS Edgar Baucher, François Dross, Cyril Gavoille
2025	J	`jnl`	Isometric-Universal Graphs for Trees. CoRR Edgar Baucher, François Dross, Cyril Gavoille
2025	A*	`conf`	Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. PODC Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025	J	`jnl`	Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. CoRR Marthe Bonamy, Cyril Gavoille, Timothé Picavet, Alexandra Wesolek
2025	C	`conf`	Lower Bounds for Induced-Universal Graphs. LAGOS Cyril Gavoille, Amaury Jacques
2025	J	`jnl`	Lower Bounds for Induced-Universal Graphs. CoRR Cyril Gavoille, Amaury Jacques
2025	C	`conf`	Universal Graph Theory Operations for Graph State Preparation. RC Tristan Cam, Cyril Gavoille, Yvan Le Borgne, Simon Martiel
2024	—	`conf`	Euclidean Freeze-Tag Problem on Plane. CCCG Saeed Odak, Cyril Gavoille, Nicolas Bonichon, Nicolas Hanusse
2024	J	`jnl`	Freeze-Tag in L CoRR Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse
2024	A	`conf`	Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. DISC Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse
2023	J	`jnl`	Minor-Universal Graph for Graphs on Surfaces. CoRR Cyril Gavoille, Claire Hilaire
2022	J	`jnl`	Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2021	A*	`conf`	2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021	J	`jnl`	Adjacency Labelling for Planar Graphs (and Beyond). J. ACM Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2021	J	`jnl`	Isometric Universal Graphs. SIAM J. Discret. Math. Louis Esperet, Cyril Gavoille, Carla Groenland
2020	A*	`conf`	Adjacency Labelling for Planar Graphs (and Beyond). FOCS Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2020	J	`jnl`	Adjacency Labelling for Planar Graphs (and Beyond). CoRR Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin
2020	—	`conf`	On the Treewidth of Planar Minor Free Graphs. InterSol Youssou Dieng, Cyril Gavoille
2020	A*	`conf`	Shorter Labeling Schemes for Planar Graphs. SODA Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2019	J	`jnl`	Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2019	—	`conf`	Localisation-Resistant Random Words with Small Alphabets. WORDS Cyril Gavoille, Ghazal Kachigar, Gilles Zémor
2019	J	`jnl`	Shorter Labeling Schemes for Planar Graphs. CoRR Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
2018	J	`jnl`	A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. Leonid Barenboim, Michael Elkin, Cyril Gavoille
2017	J	`jnl`	Towards plane spanners of degree 3. J. Comput. Geom. Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016	A	`ed.`	Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings DISC Cyril Gavoille, David Ilcinkas
2016	J	`jnl`	Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
2016	A*	`conf`	Simpler, faster and shorter labels for distances in graphs. SODA Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen
2016	B	`conf`	Towards Plane Spanners of Degree 3. ISAAC Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016	J	`jnl`	Towards Plane Spanners of Degree 3. CoRR Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2015	B	`conf`	A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). SIROCCO Leonid Barenboim, Michael Elkin, Cyril Gavoille
2015	J	`jnl`	A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. CoRR Leonid Barenboim, Michael Elkin, Cyril Gavoille
2015	A*	`conf`	Brief Announcement: Routing the Internet with Very Few Entries. PODC Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
2015	J	`jnl`	Simpler, faster and shorter labels for distances in graphs. CoRR Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen
2015	J	`jnl`	Tight stretch factors for L Comput. Geom. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2014	A*	`conf`	Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2013	J	`jnl`	Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2013	A	`conf`	On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
2012	A*	`conf`	Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC Ittai Abraham, Shiri Chechik, Cyril Gavoille
2012	J	`jnl`	The Stretch Factor of L CoRR Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2012	A	`conf`	The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2011	—	`ch.`	An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Towards an Information Theory of Complex Networks Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2011	J	`jnl`	Compact labelings for efficient first-order model-checking. J. Comb. Optim. Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2011	B	`conf`	Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. OPODIS Cyril Gavoille, Quentin Godfroy, Laurent Viennot
2011	J	`jnl`	Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners CoRR Cyril Gavoille, Quentin Godfroy, Laurent Viennot
2011	A	`conf`	On Approximate Distance Labels and Routing Schemes with Affine Stretch. DISC Ittai Abraham, Cyril Gavoille
2011	A*	`ed.`	Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011 PODC Cyril Gavoille, Pierre Fraigniaud
2011	J	`jnl`	Routage compact optimal dans les Tech. Sci. Informatiques Youssou Dieng, Cyril Gavoille
2011	B	`conf`	Sparse spanners vs. compact routing. SPAA Cyril Gavoille, Christian Sommer
2010	—	`ed.`	Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I ICALP (1) Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis
2010	—	`ed.`	Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II ICALP (2) Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis
2010	B	`conf`	Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
2010	A*	`conf`	Forbidden-set distance labels for graphs of bounded doubling dimension. PODC Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
2010	J	`jnl`	Foreword. Theory Comput. Syst. Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler
2010	B	`conf`	Multipath Spanners. SIROCCO Cyril Gavoille, Quentin Godfroy, Laurent Viennot
2010	Misc	`conf`	Path Separability of Graphs. FAW Emilie Diot, Cyril Gavoille
2010	—	`conf`	Plane Spanners of Maximum Degree Six. ICALP (1) Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
2010	J	`jnl`	Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
2009	J	`jnl`	Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2009	A	`conf`	Local Computation of Nearly Additive Spanners. DISC Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot
2009	J	`jnl`	Localized and compact data-structure for comparability graphs. Discret. Math. Fabrice Bazzaro, Cyril Gavoille
2009	J	`jnl`	On the Path Separability of Planar Graphs. Electron. Notes Discret. Math. Emilie Diot, Cyril Gavoille
2009	J	`jnl`	On the Tree-Width of Planar Graphs. Electron. Notes Discret. Math. Youssou Dieng, Cyril Gavoille
2009	J	`jnl`	On the complexity of distributed graph coloring with local minimality constraints. Networks Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra
2009	J	`jnl`	Universal augmentation schemes for network navigability. Theor. Comput. Sci. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
2009	A	`conf`	What Can Be Observed Locally? DISC Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz
2008	J	`jnl`	Compact Labelings For Efficient First-Order Model-Checking CoRR Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2008	J	`jnl`	Compact name-independent routing with minimum stretch. ACM Trans. Algorithms Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
2008	J	`jnl`	Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg
2008	Misc	`conf`	Efficient First-Order Model-Checking Using Short Labels. FAW Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
2008	J	`jnl`	Fast deterministic distributed algorithms for sparse spanners. Theor. Comput. Sci. Bilel Derbel, Cyril Gavoille
2008	J	`jnl`	On Compact Encoding of Pagenumber. Discret. Math. Theor. Comput. Sci. Cyril Gavoille, Nicolas Hanusse
2008	A*	`conf`	On the locality of distributed sparse spanner construction. PODC Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot
2008	J	`jnl`	Optimal Distance Labeling for Interval Graphs and Related Graph Families. SIAM J. Discret. Math. Cyril Gavoille, Christophe Paul
2008	B	`conf`	Polylogarithmic network navigability using compact metrics with small stretch. SPAA Pierre Fraigniaud, Cyril Gavoille
2007	J	`jnl`	Average stretch analysis of compact routing schemes. Discret. Appl. Math. Tamar Eilam, Cyril Gavoille, David Peleg
2007	A	`conf`	Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC Bilel Derbel, Cyril Gavoille, David Peleg
2007	A*	`conf`	Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
2007	B	`conf`	Distributed Relationship Schemes for Trees. ISAAC Cyril Gavoille, Arnaud Labourel
2007	A*	`conf`	On local representation of distances in trees. PODC Cyril Gavoille, Arnaud Labourel
2007	A	`conf`	On the Complexity of Distributed Greedy Coloring. DISC Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra
2007	J	`jnl`	Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
2007	A	`conf`	Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA Cyril Gavoille, Arnaud Labourel
2007	J	`jnl`	Spanners for bounded tree-length graphs. Theor. Comput. Sci. Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan
2007	B	`conf`	Strong-diameter decompositions of minor free graphs. SPAA Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
2007	J	`jnl`	Tree-decompositions with bags of small diameter. Discret. Math. Yon Dourisboure, Cyril Gavoille
2007	B	`conf`	Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
2006	B	`conf`	Distributed Data Structures: A Survey on Informative Labeling Schemes. MFCS Cyril Gavoille
2006	J	`jnl`	Eclecticism shrinks even small worlds. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
2006	B	`conf`	Fast Deterministic Distributed Algorithms for Sparse Spanners. SIROCCO Bilel Derbel, Cyril Gavoille
2006	J	`jnl`	Header-size lower bounds for end-to-end communication in memoryless networks. Comput. Networks Pierre Fraigniaud, Cyril Gavoille
2006	A*	`conf`	Object location using path separators. PODC Ittai Abraham, Cyril Gavoille
2006	B	`conf`	On space-stretch trade-offs: lower bounds. SPAA Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
2006	B	`conf`	On space-stretch trade-offs: upper bounds. SPAA Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
2006	J	`jnl`	Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
2006	A	`conf`	Routing in Networks with Low Doubling Dimension. ICDCS Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
2006	B	`conf`	Short Labels by Traversal and Jumping. SIROCCO Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
2005	J	`jnl`	Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. J. Graph Algorithms Appl. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2005	A	`conf`	Compact Routing for Graphs Excluding a Fixed Minor. DISC Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
2005	J	`jnl`	Distance Labeling for Permutation Graphs. Electron. Notes Discret. Math. Fabrice Bazzaro, Cyril Gavoille
2005	B	`conf`	Distance Labeling in Hyperbolic Graphs. ISAAC Cyril Gavoille, Olivier Ly
2005	B	`conf`	Distributed Data Structures: A Survey. SIROCCO Cyril Gavoille
2005	J	`jnl`	Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
2005	J	`jnl`	Interval routing in reliability networks. Theor. Comput. Sci. Cyril Gavoille, Martin Nehéz
2005	B	`conf`	Localized and Compact Data-Structure for Comparability Graphs. ISAAC Fabrice Bazzaro, Cyril Gavoille
2004	B	`conf`	Compact name-independent routing with minimum stretch. SPAA Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
2004	J	`jnl`	Distance labeling in graphs. J. Algorithms Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
2004	A*	`conf`	Eclecticism shrinks even small worlds. PODC Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
2004	J	`jnl`	Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
2004	B	`conf`	Planar Graphs, via Well-Orderly Maps and Trees. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
2004	A	`conf`	Routing with Improved Communication-Space Trade-Off. DISC Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
2004	B	`conf`	Sparse Additive Spanners for Bounded Tree-Length Graphs. SIROCCO Yon Dourisboure, Cyril Gavoille
2003	A	`conf`	An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2003	B	`conf`	Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
2003	J	`jnl`	Compact and localized distributed data structures. Distributed Comput. Cyril Gavoille, David Peleg
2003	J	`jnl`	Compact routing schemes with low stretch factor. J. Algorithms Tamar Eilam, Cyril Gavoille, David Peleg
2003	J	`jnl`	Distance labeling scheme and split decomposition. Discret. Math. Cyril Gavoille, Christophe Paul
2003	B	`conf`	Interval Routing in Reliability Networks. SIROCCO Cyril Gavoille, Martin Nehéz
2003	A	`conf`	Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC Pierre Fraigniaud, Cyril Gavoille
2003	A	`conf`	Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA Cyril Gavoille, Christophe Paul
2003	J	`jnl`	The compactness of adaptive routing tables. J. Discrete Algorithms Cyril Gavoille, Akka Zemmari
2002	A	`conf`	A Space Lower Bound for Routing in Trees. STACS Pierre Fraigniaud, Cyril Gavoille
2002	A	`conf`	Improved Compact Routing Scheme for Chordal Graphs. DISC Yon Dourisboure, Cyril Gavoille
2002	B	`conf`	Nearest common ancestors: a survey and a new distributed algorithm. SPAA Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
2002	J	`jnl`	Recognizing Knödel graphs. Discret. Math. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
2001	A	`conf`	Approximate Distance Labeling Schemes. ESA Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
2001	A*	`conf`	Distance labeling in graphs. SODA Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
2001	J	`jnl`	Interval routing schemes allow broadcasting with linear message-complexity. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
2001	A*	`conf`	Routing in Trees. ICALP Pierre Fraigniaud, Cyril Gavoille
2001	J	`jnl`	Routing in distributed networks: overview and open problems. SIGACT News Cyril Gavoille
2001	B	`conf`	Small k-Dominating Sets in Planar Graphs with Applications. WG Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena
2001	J	`jnl`	Space-Efficiency for Routing Schemes of Stretch Factor Three. J. Parallel Distributed Comput. Cyril Gavoille, Marc Gengler
2001	J	`jnl`	Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electron. Notes Discret. Math. Cyril Gavoille, Christophe Paul
2001	J	`jnl`	The Compactness of Interval Routing for Almost All Graphs. SIAM J. Comput. Cyril Gavoille, David Peleg
2000	J	`jnl`	A survey on interval routing. Theor. Comput. Sci. Cyril Gavoille
2000	J	`jnl`	Approximate Distance Labeling Schemes. Electron. Notes Discret. Math. Cyril Gavoille, Christophe Paul
2000	A*	`conf`	Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
2000	A	`conf`	On Recognizing Cayley Graphs. ESA Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson
2000	J	`jnl`	On the Dilation of Interval Routing. Comput. J. Cyril Gavoille
2000	B	`conf`	The compactness of adaptive routing tables. SIROCCO Cyril Gavoille, Akka Zemmari
1999	A*	`conf`	Compact Routing Tables for Graphs of Bounded Genus. ICALP Cyril Gavoille, Nicolas Hanusse
1999	B	`conf`	Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
1999	B	`ed.`	SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999 SIROCCO Cyril Gavoille, Jean-Claude Bermond, André Raspaud
1999	J	`jnl`	The Compactness of Interval Routing. SIAM J. Discret. Math. Cyril Gavoille, David Peleg
1998	B	`conf`	A Theoretical Model for Routing Complexity. SIROCCO Pierre Fraigniaud, Cyril Gavoille
1998	A*	`conf`	Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC Tamar Eilam, Cyril Gavoille, David Peleg
1998	J	`jnl`	Interval Routing Schemes. Algorithmica Pierre Fraigniaud, Cyril Gavoille
1998	A	`conf`	The Compactness of Interval Routing for Almost All Graphs. DISC Cyril Gavoille, David Peleg
1998	J	`jnl`	Worst Case Bounds for Shortest Path Interval Routing. J. Algorithms Cyril Gavoille, Eric Guévremont
1997	B	`conf`	An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. SIROCCO Cyril Gavoille, Marc Gengler
1997	B	`conf`	On the Dilation of Interval Routing. MFCS Cyril Gavoille
1997	J	`jnl`	Universal Routing Schemes. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille
1996	B	`conf`	Local Memory Requirement of Universal Routing Schemes. SPAA Pierre Fraigniaud, Cyril Gavoille
1996	B	`conf`	Lower Bounds for Shortest Path Interval Routing. SIROCCO Cyril Gavoille, Stephane Perennes
1996	A*	`conf`	Memory Requirements for Routing in Distributed Networks (Extended Abstract). PODC Cyril Gavoille, Stephane Perennes
1995	A*	`conf`	Memory Requirement for Universal Routing Schemes. PODC Pierre Fraigniaud, Cyril Gavoille
1995	B	`conf`	On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. SIROCCO Cyril Gavoille, Eric Guévremont
1994	A*	`conf`	A Characterization of Networks Supporting Linear Interval Routing. PODC Pierre Fraigniaud, Cyril Gavoille
1994	—	`conf`	Optimal Interval Routing. CONPAR Pierre Fraigniaud, Cyril Gavoille