Cyril Gavoille

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 19

Top Venues

CoRR

SIAM J. Discret. Math.

SODA

PODC

Publications

Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse
has Wake-up Time Five. CoRR (2024)
Cyril Gavoille, Claire Hilaire
Minor-Universal Graph for Graphs on Surfaces. CoRR (2023)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68 (6) (2021)
Louis Esperet, Cyril Gavoille, Carla Groenland
Isometric Universal Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC (2021)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. SODA (2020)
Youssou Dieng, Cyril Gavoille
On the Treewidth of Planar Minor Free Graphs. InterSol (2020)
Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). FOCS (2020)
Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). CoRR (2020)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. CoRR (2019)
Cyril Gavoille, Ghazal Kachigar, Gilles Zémor
Localisation-Resistant Random Words with Small Alphabets. WORDS (2019)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. 48 (3) (2019)
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. 751 (2018)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards plane spanners of degree 3. J. Comput. Geom. 8 (1) (2017)
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen
Simpler, faster and shorter labels for distances in graphs. SODA (2016)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards Plane Spanners of Degree 3. CoRR (2016)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
Towards Plane Spanners of Degree 3. ISAAC (2016)
Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms 12 (2) (2016)
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen
Simpler, faster and shorter labels for distances in graphs. CoRR (2015)
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. CoRR (2015)
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
Brief Announcement: Routing the Internet with Very Few Entries. PODC (2015)
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). SIROCCO (2015)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
-Delaunay triangulations. Comput. Geom. 48 (3) (2015)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC (2014)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR (2013)
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC (2013)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
-Delaunay Triangulations CoRR (2012)
Ittai Abraham, Shiri Chechik, Cyril Gavoille
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC (2012)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA (2012)
Cyril Gavoille, Quentin Godfroy, Laurent Viennot
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners CoRR (2011)
Ittai Abraham, Cyril Gavoille
On Approximate Distance Labels and Routing Schemes with Affine Stretch. DISC (2011)
Cyril Gavoille, Christian Sommer
Sparse spanners vs. compact routing. SPAA (2011)
Cyril Gavoille, Quentin Godfroy, Laurent Viennot
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. OPODIS (2011)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21 (1) (2011)
Youssou Dieng, Cyril Gavoille
-constellations. Tech. Sci. Informatiques 30 (5) (2011)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG (2010)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic
Plane Spanners of Maximum Degree Six. ICALP (1) (2010)
Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
Forbidden-set distance labels for graphs of bounded doubling dimension. PODC (2010)
Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler
Foreword. Theory Comput. Syst. 47 (4) (2010)
Cyril Gavoille, Quentin Godfroy, Laurent Viennot
Multipath Spanners. SIROCCO (2010)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. 47 (4) (2010)
Emilie Diot, Cyril Gavoille
Path Separability of Graphs. FAW (2010)
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra
On the complexity of distributed graph coloring with local minimality constraints. Networks 54 (1) (2009)
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21 (6) (2009)
Youssou Dieng, Cyril Gavoille
On the Tree-Width of Planar Graphs. Electron. Notes Discret. Math. 34 (2009)
Fabrice Bazzaro, Cyril Gavoille
Localized and compact data-structure for comparability graphs. Discret. Math. 309 (11) (2009)
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
Universal augmentation schemes for network navigability. Theor. Comput. Sci. 410 (21-23) (2009)
Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz
What Can Be Observed Locally? DISC (2009)
Emilie Diot, Cyril Gavoille
On the Path Separability of Planar Graphs. Electron. Notes Discret. Math. 34 (2009)
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot
Local Computation of Nearly Additive Spanners. DISC (2009)
Cyril Gavoille, Nicolas Hanusse
On Compact Encoding of Pagenumber. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact Labelings For Efficient First-Order Model-Checking CoRR (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Efficient First-Order Model-Checking Using Short Labels. FAW (2008)
Bilel Derbel, Cyril Gavoille
Fast deterministic distributed algorithms for sparse spanners. Theor. Comput. Sci. 399 (1-2) (2008)
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot
On the locality of distributed sparse spanner construction. PODC (2008)
Pierre Fraigniaud, Cyril Gavoille
Polylogarithmic network navigability using compact metrics with small stretch. SPAA (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg
Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. 31 (2008)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4 (3) (2008)
Cyril Gavoille, Christophe Paul
Optimal Distance Labeling for Interval Graphs and Related Graph Families. SIAM J. Discret. Math. 22 (3) (2008)
Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. 28 (2007)
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP (2007)
Yon Dourisboure, Cyril Gavoille
Tree-decompositions with bags of small diameter. Discret. Math. 307 (16) (2007)
Tamar Eilam, Cyril Gavoille, David Peleg
Average stretch analysis of compact routing schemes. Discret. Appl. Math. 155 (5) (2007)
Bilel Derbel, Cyril Gavoille, David Peleg
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC (2007)
Cyril Gavoille, Arnaud Labourel
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA (2007)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
Strong-diameter decompositions of minor free graphs. SPAA (2007)
Cyril Gavoille, Arnaud Labourel
On local representation of distances in trees. PODC (2007)
Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan
Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383 (1) (2007)
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA (2007)
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra
On the Complexity of Distributed Greedy Coloring. DISC (2007)
Cyril Gavoille, Arnaud Labourel
Distributed Relationship Schemes for Trees. ISAAC (2007)
Bilel Derbel, Cyril Gavoille
Fast Deterministic Distributed Algorithms for Sparse Spanners. SIROCCO (2006)
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
Routing in Networks with Low Doubling Dimension. ICDCS (2006)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
On space-stretch trade-offs: lower bounds. SPAA (2006)
Ittai Abraham, Cyril Gavoille
Object location using path separators. PODC (2006)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
On space-stretch trade-offs: upper bounds. SPAA (2006)
Cyril Gavoille
Distributed Data Structures: A Survey on Informative Labeling Schemes. MFCS (2006)
Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Short Labels by Traversal and Jumping. SIROCCO (2006)
Pierre Fraigniaud, Cyril Gavoille
Header-size lower bounds for end-to-end communication in memoryless networks. Comput. Networks 50 (10) (2006)
Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
Eclecticism shrinks even small worlds. Distributed Comput. 18 (4) (2006)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. 22 (2) (2006)
Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. 22 (2005)
Cyril Gavoille
Distributed Data Structures: A Survey. SIROCCO (2005)
Fabrice Bazzaro, Cyril Gavoille
Localized and Compact Data-Structure for Comparability Graphs. ISAAC (2005)
Fabrice Bazzaro, Cyril Gavoille
Distance Labeling for Permutation Graphs. Electron. Notes Discret. Math. 22 (2005)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. J. Graph Algorithms Appl. 9 (2) (2005)
Cyril Gavoille, Olivier Ly
Distance Labeling in Hyperbolic Graphs. ISAAC (2005)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
Compact Routing for Graphs Excluding a Fixed Minor. DISC (2005)
Cyril Gavoille, Martin Nehéz
Interval routing in reliability networks. Theor. Comput. Sci. 333 (3) (2005)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
Routing with Improved Communication-Space Trade-Off. DISC (2004)
Yon Dourisboure, Cyril Gavoille
Sparse Additive Spanners for Bounded Tree-Length Graphs. SIROCCO (2004)
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. 37 (3) (2004)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
Planar Graphs, via Well-Orderly Maps and Trees. WG (2004)
Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
Distance labeling in graphs. J. Algorithms 53 (1) (2004)
Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
Eclecticism shrinks even small worlds. PODC (2004)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
Compact name-independent routing with minimum stretch. SPAA (2004)
Cyril Gavoille, Christophe Paul
Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA (2003)
Cyril Gavoille, Martin Nehéz
Interval Routing in Reliability Networks. SIROCCO (2003)
Cyril Gavoille, Christophe Paul
Distance labeling scheme and split decomposition. Discret. Math. 273 (1-3) (2003)

Cyril Gavoille.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Cyril Gavoille