default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCyril Gavoille
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c80]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. DISC 2024: 9:1-9:16- [i11]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L1 has Wake-up Time Five. CoRR abs/2402.03258 (2024) - 2023
- [i10]Cyril Gavoille, Claire Hilaire:
Minor-Universal Graph for Graphs on Surfaces. CoRR abs/2305.06673 (2023) - 2022
- [j53]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. 36(3): 2082-2099 (2022) - 2021
- [j52]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - [j51]Louis Esperet
, Cyril Gavoille, Carla Groenland:
Isometric Universal Graphs. SIAM J. Discret. Math. 35(2): 1224-1237 (2021) - [c79]Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1 - 2020
- [c78]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - [c77]Youssou Dieng, Cyril Gavoille:
On the Treewidth of Planar Minor Free Graphs. InterSol 2020: 238-250 - [c76]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. SODA 2020: 446-462 - [i9]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020)
2010 – 2019
- 2019
- [j50]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): 1120-1145 (2019) - [c75]Cyril Gavoille, Ghazal Kachigar, Gilles Zémor:
Localisation-Resistant Random Words with Small Alphabets. WORDS 2019: 193-206 - [i8]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. CoRR abs/1908.03341 (2019) - 2018
- [j49]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. 751: 2-23 (2018) - 2017
- [j48]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): 11-31 (2017) - 2016
- [j47]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms 12(2): 22:1-22:17 (2016) - [c74]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c73]Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. SODA 2016: 338-350 - [e5]Cyril Gavoille, David Ilcinkas:
Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. Lecture Notes in Computer Science 9888, Springer 2016, ISBN 978-3-662-53425-0 [contents] - [i7]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016) - 2015
- [j46]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Tight stretch factors for L1- and L∞-Delaunay triangulations. Comput. Geom. 48(3): 237-250 (2015) - [c72]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
Brief Announcement: Routing the Internet with Very Few Entries. PODC 2015: 33-35 - [c71]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). SIROCCO 2015: 209-223 - [i6]Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. CoRR abs/1504.04498 (2015) - [i5]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. CoRR abs/1505.05697 (2015) - 2014
- [c70]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC 2014: 79-88 - 2013
- [c69]Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas:
On the Communication Complexity of Distributed Name-Independent Routing Schemes. DISC 2013: 418-432 - [i4]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR abs/1311.3048 (2013) - 2012
- [c68]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. ESA 2012: 205-216 - [c67]Ittai Abraham, Shiri Chechik, Cyril Gavoille:
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC 2012: 1199-1218 - [i3]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L1- and L∞-Delaunay Triangulations. CoRR abs/1202.5127 (2012) - 2011
- [j45]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21(1): 19-46 (2011) - [j44]Youssou Dieng, Cyril Gavoille:
Routage compact optimal dans les (k, r)-constellations. Tech. Sci. Informatiques 30(5): 485-513 (2011) - [c66]Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. OPODIS 2011: 143-158 - [c65]Cyril Gavoille, Christian Sommer:
Sparse spanners vs. compact routing. SPAA 2011: 225-234 - [c64]Ittai Abraham, Cyril Gavoille:
On Approximate Distance Labels and Routing Schemes with Affine Stretch. DISC 2011: 404-415 - [p1]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Towards an Information Theory of Complex Networks 2011: 17-46 - [e4]Cyril Gavoille, Pierre Fraigniaud:
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011. ACM 2011, ISBN 978-1-4503-0719-2 [contents] - [i2]Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners. CoRR abs/1109.2696 (2011) - 2010
- [j43]Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler:
Foreword. Theory Comput. Syst. 47(4): 809-810 (2010) - [j42]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. 47(4): 837-855 (2010) - [c63]Emilie Diot, Cyril Gavoille:
Path Separability of Graphs. FAW 2010: 262-273 - [c62]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30 - [c61]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-set distance labels for graphs of bounded doubling dimension. PODC 2010: 192-200 - [c60]Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Multipath Spanners. SIROCCO 2010: 211-223 - [c59]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas:
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278 - [e3]Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6198, Springer 2010, ISBN 978-3-642-14164-5 [contents] - [e2]Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6199, Springer 2010, ISBN 978-3-642-14161-4 [contents]
2000 – 2009
- 2009
- [j41]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed computing with advice: information sensitivity of graph coloring. Distributed Comput. 21(6): 395-403 (2009) - [j40]Fabrice Bazzaro, Cyril Gavoille:
Localized and compact data-structure for comparability graphs. Discret. Math. 309(11): 3465-3484 (2009) - [j39]Emilie Diot, Cyril Gavoille:
On the Path Separability of Planar Graphs. Electron. Notes Discret. Math. 34: 549-552 (2009) - [j38]Youssou Dieng, Cyril Gavoille:
On the Tree-Width of Planar Graphs. Electron. Notes Discret. Math. 34: 593-596 (2009) - [j37]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra:
On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1): 12-19 (2009) - [j36]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability. Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) - [c58]Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
Local Computation of Nearly Additive Spanners. DISC 2009: 176-190 - [c57]Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz:
What Can Be Observed Locally? DISC 2009: 243-257 - 2008
- [j35]Cyril Gavoille, Nicolas Hanusse:
On Compact Encoding of Pagenumber. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j34]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg:
Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. 31: 151-155 (2008) - [j33]Cyril Gavoille, Christophe Paul:
Optimal Distance Labeling for Interval Graphs and Related Graph Families. SIAM J. Discret. Math. 22(3): 1239-1258 (2008) - [j32]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4(3): 37:1-37:12 (2008) - [j31]Bilel Derbel, Cyril Gavoille:
Fast deterministic distributed algorithms for sparse spanners. Theor. Comput. Sci. 399(1-2): 83-100 (2008) - [c56]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Efficient First-Order Model-Checking Using Short Labels. FAW 2008: 159-170 - [c55]Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
On the locality of distributed sparse spanner construction. PODC 2008: 273-282 - [c54]Pierre Fraigniaud, Cyril Gavoille:
Polylogarithmic network navigability using compact metrics with small stretch. SPAA 2008: 62-69 - [i1]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact Labelings For Efficient First-Order Model-Checking. CoRR abs/0811.4713 (2008) - 2007
- [j30]Tamar Eilam, Cyril Gavoille, David Peleg:
Average stretch analysis of compact routing schemes. Discret. Appl. Math. 155(5): 598-610 (2007) - [j29]Yon Dourisboure, Cyril Gavoille:
Tree-decompositions with bags of small diameter. Discret. Math. 307(16): 2008-2029 (2007) - [j28]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. 28: 153-160 (2007) - [j27]Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan:
Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383(1): 34-44 (2007) - [c53]Cyril Gavoille, Arnaud Labourel:
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA 2007: 582-593 - [c52]Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - [c51]Cyril Gavoille, Arnaud Labourel:
Distributed Relationship Schemes for Trees. ISAAC 2007: 728-738 - [c50]Cyril Gavoille, Arnaud Labourel:
On local representation of distances in trees. PODC 2007: 352-353 - [c49]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA 2007: 1-7 - [c48]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24 - [c47]Bilel Derbel, Cyril Gavoille, David Peleg:
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC 2007: 179-192 - [c46]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484 - 2006
- [j26]Pierre Fraigniaud, Cyril Gavoille:
Header-size lower bounds for end-to-end communication in memoryless networks. Comput. Networks 50(10): 1630-1638 (2006) - [j25]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. Distributed Comput. 18(4): 279-291 (2006) - [j24]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. 22(2): 185-202 (2006) - [c45]Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi:
Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75 - [c44]Cyril Gavoille:
Distributed Data Structures: A Survey on Informative Labeling Schemes. MFCS 2006: 38 - [c43]Ittai Abraham, Cyril Gavoille:
Object location using path separators. PODC 2006: 188-197 - [c42]Bilel Derbel, Cyril Gavoille:
Fast Deterministic Distributed Algorithms for Sparse Spanners. SIROCCO 2006: 100-114 - [c41]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156 - [c40]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
On space-stretch trade-offs: lower bounds. SPAA 2006: 207-216 - [c39]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
On space-stretch trade-offs: upper bounds. SPAA 2006: 217-224 - 2005
- [j23]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. 22: 421-425 (2005) - [j22]Fabrice Bazzaro, Cyril Gavoille:
Distance Labeling for Permutation Graphs. Electron. Notes Discret. Math. 22: 461-467 (2005) - [j21]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. J. Graph Algorithms Appl. 9(2): 185-204 (2005) - [j20]Cyril Gavoille, Martin Nehéz:
Interval routing in reliability networks. Theor. Comput. Sci. 333(3): 415-432 (2005) - [c38]Cyril Gavoille, Olivier Ly:
Distance Labeling in Hyperbolic Graphs. ISAAC 2005: 1071-1079 - [c37]Fabrice Bazzaro, Cyril Gavoille:
Localized and Compact Data-Structure for Comparability Graphs. ISAAC 2005: 1122-1131 - [c36]Cyril Gavoille:
Distributed Data Structures: A Survey. SIROCCO 2005: 2 - [c35]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
Compact Routing for Graphs Excluding a Fixed Minor. DISC 2005: 442-456 - 2004
- [j19]Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz:
Distance labeling in graphs. J. Algorithms 53(1): 85-112 (2004) - [j18]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): 441-456 (2004) - [c34]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. PODC 2004: 169-178 - [c33]Yon Dourisboure, Cyril Gavoille:
Sparse Additive Spanners for Bounded Tree-Length Graphs. SIROCCO 2004: 123-137 - [c32]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. SPAA 2004: 20-24 - [c31]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
Routing with Improved Communication-Space Trade-Off. DISC 2004: 305-319 - [c30]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284 - 2003
- [j17]Cyril Gavoille, David Peleg:
Compact and localized distributed data structures. Distributed Comput. 16(2-3): 111-120 (2003) - [j16]Cyril Gavoille, Christophe Paul:
Distance labeling scheme and split decomposition. Discret. Math. 273(1-3): 115-130 (2003) - [j15]Tamar Eilam, Cyril Gavoille, David Peleg:
Compact routing schemes with low stretch factor. J. Algorithms 46(2): 97-114 (2003) - [j14]Cyril Gavoille, Akka Zemmari:
The compactness of adaptive routing tables. J. Discrete Algorithms 1(2): 237-254 (2003) - [c29]Cyril Gavoille, Christophe Paul:
Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA 2003: 254-265 - [c28]Cyril Gavoille, Martin Nehéz:
Interval Routing in Reliability Networks. SIROCCO 2003: 147-162 - [c27]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS 2003: 499-510 - [c26]Pierre Fraigniaud, Cyril Gavoille:
Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC 2003: 211-223 - [c25]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse:
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92 - 2002
- [j13]Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Knödel graphs. Discret. Math. 250(1-3): 41-62 (2002) - [c24]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264 - [c23]Pierre Fraigniaud, Cyril Gavoille:
A Space Lower Bound for Routing in Trees. STACS 2002: 65-75 - [c22]Yon Dourisboure, Cyril Gavoille:
Improved Compact Routing Scheme for Chordal Graphs. DISC 2002: 252-264 - 2001
- [j12]Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity. Distributed Comput. 14(4): 217-229 (2001) - [j11]Cyril Gavoille, Christophe Paul:
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electron. Notes Discret. Math. 10: 117-120 (2001) - [j10]Cyril Gavoille, Marc Gengler:
Space-Efficiency for Routing Schemes of Stretch Factor Three. J. Parallel Distributed Comput. 61(5): 679-687 (2001) - [j9]Cyril Gavoille, David Peleg:
The Compactness of Interval Routing for Almost All Graphs. SIAM J. Comput. 31(3): 706-721 (2001) - [j8]Cyril Gavoille:
Routing in distributed networks: overview and open problems. SIGACT News 32(1): 36-52 (2001) - [c21]Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg:
Approximate Distance Labeling Schemes. ESA 2001: 476-487 - [c20]Pierre Fraigniaud, Cyril Gavoille:
Routing in Trees. ICALP 2001: 757-772 - [c19]Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz:
Distance labeling in graphs. SODA 2001: 210-219 - [c18]Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena:
Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216 - 2000
- [j7]Cyril Gavoille:
On the Dilation of Interval Routing. Comput. J. 43(3): 243-249 (2000) - [j6]Cyril Gavoille, Christophe Paul:
Approximate Distance Labeling Schemes. Electron. Notes Discret. Math. 5: 134-137 (2000) - [j5]Cyril Gavoille:
A survey on interval routing. Theor. Comput. Sci. 245(2): 217-253 (2000) - [c17]Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson:
On Recognizing Cayley Graphs. ESA 2000: 76-87 - [c16]Pierre Fraigniaud, Cyril Gavoille, Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC 2000: 11-20 - [c15]Cyril Gavoille, Akka Zemmari:
The compactness of adaptive routing tables. SIROCCO 2000: 127-139
1990 – 1999
- 1999
- [j4]Cyril Gavoille, David Peleg:
The Compactness of Interval Routing. SIAM J. Discret. Math. 12(4): 459-473 (1999) - [c14]Cyril Gavoille, Nicolas Hanusse:
Compact Routing Tables for Graphs of Bounded Genus. ICALP 1999: 351-360 - [c13]Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille:
Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG 1999: 215-227 - [e1]Cyril Gavoille, Jean-Claude Bermond, André Raspaud:
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999. Carleton Scientific 1999 [contents] - 1998
- [j3]Pierre Fraigniaud, Cyril Gavoille:
Interval Routing Schemes. Algorithmica 21(2): 155-182 (1998) - [j2]Cyril Gavoille, Eric Guévremont:
Worst Case Bounds for Shortest Path Interval Routing. J. Algorithms 27(1): 1-25 (1998) - [c12]Tamar Eilam, Cyril Gavoille, David Peleg:
Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC 1998: 11-20 - [c11]Pierre Fraigniaud, Cyril Gavoille:
A Theoretical Model for Routing Complexity. SIROCCO 1998: 98-113 - [c10]Cyril Gavoille, David Peleg:
The Compactness of Interval Routing for Almost All Graphs. DISC 1998: 161-174 - 1997
- [j1]Pierre Fraigniaud, Cyril Gavoille:
Universal Routing Schemes. Distributed Comput. 10(2): 65-78 (1997) - [c9]Cyril Gavoille:
On the Dilation of Interval Routing. MFCS 1997: 259-268 - [c8]Cyril Gavoille, Marc Gengler:
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. SIROCCO 1997: 162-175 - 1996
- [c7]Cyril Gavoille, Stephane Perennes:
Memory Requirements for Routing in Distributed Networks (Extended Abstract). PODC 1996: 125-133 - [c6]Cyril Gavoille, Stephane Perennes:
Lower Bounds for Shortest Path Interval Routing. SIROCCO 1996: 88-103 - [c5]Pierre Fraigniaud, Cyril Gavoille:
Local Memory Requirement of Universal Routing Schemes. SPAA 1996: 183-188 - 1995
- [c4]Pierre Fraigniaud, Cyril Gavoille:
Memory Requirement for Universal Routing Schemes. PODC 1995: 223-230 - [c3]Cyril Gavoille, Eric Guévremont:
On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. SIROCCO 1995: 113-121 - 1994
- [c2]Pierre Fraigniaud, Cyril Gavoille:
Optimal Interval Routing. CONPAR 1994: 785-796 - [c1]Pierre Fraigniaud, Cyril Gavoille:
A Characterization of Networks Supporting Linear Interval Routing. PODC 1994: 216-224
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
