| 2026 | MFCS | Freeze-Tag with Return. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Tassir Marc, Nils Morawietz |
| 2026 | PODC | Meta-Theorems for Cuttable Distributed Problems. | Marthe Bonamy, Cyril Gavoille, Avinandan Das, Jukka Suomela, Timoth Picavet, Alexandra Wesolek |
| 2025 | ESA | An Improved Bound for Plane Covering Paths. | 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 | LAGOS | Lower Bounds for Induced-Universal Graphs. | Cyril Gavoille, Amaury Jacques |
| 2025 | MFCS | Isometric-Universal Graphs for Trees. | Edgar Baucher, Franois Dross, Cyril Gavoille |
| 2025 | PODC | Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors. | Marthe Bonamy, Cyril Gavoille, Timoth Picavet, Alexandra Wesolek |
| 2025 | PODC | Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm. | Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Tassir Marc |
| 2025 | RC | Universal Graph Theory Operations for Graph State Preparation. | Tristan Cam, Cyril Gavoille, Yvan Le Borgne, Simon Martiel |
| 2021 | PODC | 2021 Edsger W. Dijkstra Prize in Distributed Computing. | Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg |
| 2020 | FOCS | Adjacency Labelling for Planar Graphs (and Beyond). | Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenal Joret, Piotr Micek, Pat Morin |
| 2020 | SODA | Shorter Labeling Schemes for Planar Graphs. | Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk |
| 2016 | ISAAC | Towards Plane Spanners of Degree 3. | Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | SODA | Simpler, faster and shorter labels for distances in graphs. | Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen |
| 2015 | PODC | Brief Announcement: Routing the Internet with Very Few Entries. | Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas |
| 2015 | SIROCCO | A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). | Leonid Barenboim, Michael Elkin, Cyril Gavoille |
| 2014 | STOC | Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. | Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar |
| 2012 | ESA | The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic |
| 2012 | STOC | Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. | Ittai Abraham, Shiri Chechik, Cyril Gavoille |
| 2011 | OPODIS | Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. | Cyril Gavoille, Quentin Godfroy, Laurent Viennot |
| 2011 | SPAA | Sparse spanners vs. compact routing. | Cyril Gavoille, Christian Sommer |
| 2010 | FAW | Path Separability of Graphs. | Emilie Diot, Cyril Gavoille |
| 2010 | ICALP | Plane Spanners of Maximum Degree Six. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic |
| 2010 | PODC | Forbidden-set distance labels for graphs of bounded doubling dimension. | Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg |
| 2010 | SIROCCO | Multipath Spanners. | Cyril Gavoille, Quentin Godfroy, Laurent Viennot |
| 2010 | WG | Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas |
| 2008 | FAW | Efficient First-Order Model-Checking Using Short Labels. | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kant |
| 2008 | PODC | On the locality of distributed sparse spanner construction. | Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot |
| 2008 | SPAA | Polylogarithmic network navigability using compact metrics with small stretch. | Pierre Fraigniaud, Cyril Gavoille |
| 2007 | ESA | Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. | Cyril Gavoille, Arnaud Labourel |
| 2007 | ICALP | Distributed Computing with Advice: Information Sensitivity of Graph Coloring. | Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
| 2007 | ISAAC | Distributed Relationship Schemes for Trees. | Cyril Gavoille, Arnaud Labourel |
| 2007 | PODC | On local representation of distances in trees. | Cyril Gavoille, Arnaud Labourel |
| 2007 | SPAA | Strong-diameter decompositions of minor free graphs. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder |
| 2007 | SPAA | Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. | Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker |
| 2006 | ICDCS | Routing in Networks with Low Doubling Dimension. | Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi |
| 2006 | MFCS | Distributed Data Structures: A Survey on Informative Labeling Schemes. | Cyril Gavoille |
| 2006 | PODC | Object location using path separators. | Ittai Abraham, Cyril Gavoille |
| 2006 | SPAA | On space-stretch trade-offs: lower bounds. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi |
| 2006 | SPAA | On space-stretch trade-offs: upper bounds. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi |
| 2006 | SIROCCO | Short Labels by Traversal and Jumping. | Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel |
| 2006 | SIROCCO | Fast Deterministic Distributed Algorithms for Sparse Spanners. | Bilel Derbel, Cyril Gavoille |
| 2005 | ISAAC | Localized and Compact Data-Structure for Comparability Graphs. | Fabrice Bazzaro, Cyril Gavoille |
| 2005 | ISAAC | Distance Labeling in Hyperbolic Graphs. | Cyril Gavoille, Olivier Ly |
| 2005 | SIROCCO | Distributed Data Structures: A Survey. | Cyril Gavoille |
| 2004 | PODC | Eclecticism shrinks even small worlds. | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul |
| 2004 | SPAA | Compact name-independent routing with minimum stretch. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup |
| 2004 | SIROCCO | Sparse Additive Spanners for Bounded Tree-Length Graphs. | Yon Dourisboure, Cyril Gavoille |
| 2004 | WG | Planar Graphs, via Well-Orderly Maps and Trees. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer |
| 2003 | ESA | Optimal Distance Labeling for Interval and Circular-Arc Graphs. | Cyril Gavoille, Christophe Paul |
| 2003 | STACS | An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse |
| 2003 | SIROCCO | Interval Routing in Reliability Networks. | Cyril Gavoille, Martin Nehz |
| 2003 | WG | Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse |
| 2002 | STACS | A Space Lower Bound for Routing in Trees. | Pierre Fraigniaud, Cyril Gavoille |
| 2002 | SPAA | Nearest common ancestors: a survey and a new distributed algorithm. | Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe |
| 2001 | ESA | Approximate Distance Labeling Schemes. | Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg |
| 2001 | ICALP | Routing in Trees. | Pierre Fraigniaud, Cyril Gavoille |
| 2001 | SODA | Distance labeling in graphs. | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
| 2001 | WG | Small k-Dominating Sets in Planar Graphs with Applications. | Cyril Gavoille, David Peleg, Andr Raspaud, ric Sopena |
| 2000 | ESA | On Recognizing Cayley Graphs. | Lali Barrire, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson |
| 2000 | PODC | Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). | Pierre Fraigniaud, Cyril Gavoille, Bernard Mans |
| 2000 | SIROCCO | The compactness of adaptive routing tables. | Cyril Gavoille, Akka Zemmari |
| 1999 | ICALP | Compact Routing Tables for Graphs of Bounded Genus. | Cyril Gavoille, Nicolas Hanusse |
| 1999 | WG | Recognizing Bipartite Incident-Graphs of Circulant Digraphs. | Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille |
| 1998 | PODC | Compact Routing Schemes with Low Stretch Factor (Extended Abstract). | Tamar Eilam, Cyril Gavoille, David Peleg |
| 1998 | SIROCCO | A Theoretical Model for Routing Complexity. | Pierre Fraigniaud, Cyril Gavoille |
| 1997 | MFCS | On the Dilation of Interval Routing. | Cyril Gavoille |
| 1997 | SIROCCO | An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. | Cyril Gavoille, Marc Gengler |
| 1996 | PODC | Memory Requirements for Routing in Distributed Networks (Extended Abstract). | Cyril Gavoille, Stephane Perennes |
| 1996 | SPAA | Local Memory Requirement of Universal Routing Schemes. | Pierre Fraigniaud, Cyril Gavoille |
| 1996 | SIROCCO | Lower Bounds for Shortest Path Interval Routing. | Cyril Gavoille, Stephane Perennes |
| 1995 | PODC | Memory Requirement for Universal Routing Schemes. | Pierre Fraigniaud, Cyril Gavoille |
| 1995 | SIROCCO | On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. | Cyril Gavoille, Eric Guvremont |
| 1994 | PODC | A Characterization of Networks Supporting Linear Interval Routing. | Pierre Fraigniaud, Cyril Gavoille |