Cyril Gavoille

	2012
119		Ittai Abraham, Shiri Chechik, Cyril Gavoille: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC 2012: 1199-1218
118		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic: The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations CoRR abs/1202.5127: (2012)
	2011
117		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
116		Ittai Abraham, Cyril Gavoille: On Approximate Distance Labels and Routing Schemes with Affine Stretch. DISC 2011: 404-415
115		Cyril Gavoille, Quentin Godfroy, Laurent Viennot: Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. OPODIS 2011: 143-158
114		Cyril Gavoille, Christian Sommer: Sparse spanners vs. compact routing. SPAA 2011: 225-234
113		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
112		Cyril Gavoille, Quentin Godfroy, Laurent Viennot: Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners CoRR abs/1109.2696: (2011)
111		Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21(1): 19-46 (2011)
110		Youssou Dieng, Cyril Gavoille: Routage compact optimal dans les (k, r)-constellations. Technique et Science Informatiques 30(5): 485-513 (2011)
	2010
109		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 Springer 2010
108		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 Springer 2010
107		Emilie Diot, Cyril Gavoille: Path Separability of Graphs. FAW 2010: 262-273
106		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic: Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30
105		Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg: Forbidden-set distance labels for graphs of bounded doubling dimension. PODC 2010: 192-200
104		Cyril Gavoille, Quentin Godfroy, Laurent Viennot: Multipath Spanners. SIROCCO 2010: 211-223
103		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010: 266-278
102		Cyril Gavoille, Boaz Patt-Shamir, Christian Scheideler: Foreword. Theory Comput. Syst. 47(4): 809-810 (2010)
101		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder: Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. 47(4): 837-855 (2010)
	2009
100		Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot: Local Computation of Nearly Additive Spanners. DISC 2009: 176-190
99		Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz: What Can Be Observed Locally? DISC 2009: 243-257
98		Fabrice Bazzaro, Cyril Gavoille: Localized and compact data-structure for comparability graphs. Discrete Mathematics 309(11): 3465-3484 (2009)
97		Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21(6): 395-403 (2009)
96		Emilie Diot, Cyril Gavoille: On the Path Separability of Planar Graphs. Electronic Notes in Discrete Mathematics 34: 549-552 (2009)
95		Youssou Dieng, Cyril Gavoille: On the Tree-Width of Planar Graphs. Electronic Notes in Discrete Mathematics 34: 593-596 (2009)
94		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)
93		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)
	2008
92		Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Efficient First-Order Model-Checking Using Short Labels. FAW 2008: 159-170
91		Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot: On the locality of distributed sparse spanner construction. PODC 2008: 273-282
90		Pierre Fraigniaud, Cyril Gavoille: Polylogarithmic network navigability using compact metrics with small stretch. SPAA 2008: 62-69
89		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3): (2008)
88		Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Compact Labelings For Efficient First-Order Model-Checking CoRR abs/0811.4713: (2008)
87		Cyril Gavoille, Nicolas Hanusse: On Compact Encoding of Pagenumber. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
86		Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg: Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics 31: 151-155 (2008)
85		Cyril Gavoille, Christophe Paul: Optimal Distance Labeling for Interval Graphs and Related Graph Families. SIAM J. Discrete Math. 22(3): 1239-1258 (2008)
84		Bilel Derbel, Cyril Gavoille: Fast deterministic distributed algorithms for sparse spanners. Theor. Comput. Sci. 399(1-2): 83-100 (2008)
	2007
83		Bilel Derbel, Cyril Gavoille, David Peleg: Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC 2007: 179-192
82		Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra: On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484
81		Cyril Gavoille, Arnaud Labourel: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA 2007: 582-593
80		Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242
79		Cyril Gavoille, Arnaud Labourel: Distributed Relationship Schemes for Trees. ISAAC 2007: 728-738
78		Cyril Gavoille, Arnaud Labourel: On local representation of distances in trees. PODC 2007: 352-353
77		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
76		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder: Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24
75		Tamar Eilam, Cyril Gavoille, David Peleg: Average stretch analysis of compact routing schemes. Discrete Applied Mathematics 155(5): 598-610 (2007)
74		Yon Dourisboure, Cyril Gavoille: Tree-decompositions with bags of small diameter. Discrete Mathematics 307(16): 2008-2029 (2007)
73		Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel: Short Labels by Traversal and Jumping. Electronic Notes in Discrete Mathematics 28: 153-160 (2007)
72		Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383(1): 34-44 (2007)
	2006
71		Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi: Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75
70		Cyril Gavoille: Distributed Data Structures: A Survey on Informative Labeling Schemes. MFCS 2006: 38
69		Ittai Abraham, Cyril Gavoille: Object location using path separators. PODC 2006: 188-197
68		Bilel Derbel, Cyril Gavoille: Fast Deterministic Distributed Algorithms for Sparse Spanners. SIROCCO 2006: 100-114
67		Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel: Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156
66		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: On space-stretch trade-offs: lower bounds. SPAA 2006: 207-216
65		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: On space-stretch trade-offs: upper bounds. SPAA 2006: 217-224
64		Pierre Fraigniaud, Cyril Gavoille: Header-size lower bounds for end-to-end communication in memoryless networks. Computer Networks 50(10): 1630-1638 (2006)
63		Pierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. Distributed Computing 18(4): 279-291 (2006)
62		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer: Planar Graphs, via Well-Orderly Maps and Trees. Graphs and Combinatorics 22(2): 185-202 (2006)
	2005
61		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: Compact Routing for Graphs Excluding a Fixed Minor. DISC 2005: 442-456
60		Cyril Gavoille, Olivier Ly: Distance Labeling in Hyperbolic Graphs. ISAAC 2005: 1071-1079
59		Fabrice Bazzaro, Cyril Gavoille: Localized and Compact Data-Structure for Comparability Graphs. ISAAC 2005: 1122-1131
58		Cyril Gavoille: Distributed Data Structures: A Survey. SIROCCO 2005: 2
57		Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel: Edge Partition of Toroidal Graphs into Forests in Linear Time. Electronic Notes in Discrete Mathematics 22: 421-425 (2005)
56		Fabrice Bazzaro, Cyril Gavoille: Distance Labeling for Permutation Graphs. Electronic Notes in Discrete Mathematics 22: 461-467 (2005)
55		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)
54		Cyril Gavoille, Martin Nehéz: Interval routing in reliability networks. Theor. Comput. Sci. 333(3): 415-432 (2005)
	2004
53		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi: Routing with Improved Communication-Space Trade-Off. DISC 2004: 305-319
52		Pierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. PODC 2004: 169-178
51		Yon Dourisboure, Cyril Gavoille: Sparse Additive Spanners for Bounded Tree-Length Graphs. SIROCCO 2004: 123-137
50		Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. SPAA 2004: 20-24
49		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer: Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284
48		Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz: Distance labeling in graphs. J. Algorithms 53(1): 85-112 (2004)
	2003
47		Pierre Fraigniaud, Cyril Gavoille: Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC 2003: 211-223
46		Cyril Gavoille, Christophe Paul: Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA 2003: 254-265
45		Cyril Gavoille, Martin Nehéz: Interval Routing in Reliability Networks. SIROCCO 2003: 147-162
44		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse: An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS 2003: 499-510
43		Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse: Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92
42		Cyril Gavoille, Christophe Paul: Distance labeling scheme and split decomposition. Discrete Mathematics 273(1-3): 115-130 (2003)
41		Cyril Gavoille, David Peleg: Compact and localized distributed data structures. Distributed Computing 16(2-3): 111-120 (2003)
40		Tamar Eilam, Cyril Gavoille, David Peleg: Compact routing schemes with low stretch factor. J. Algorithms 46(2): 97-114 (2003)
39		Cyril Gavoille, Akka Zemmari: The compactness of adaptive routing tables. J. Discrete Algorithms 1(2): 237-254 (2003)
	2002
38		Yon Dourisboure, Cyril Gavoille: Improved Compact Routing Scheme for Chordal Graphs. DISC 2002: 252-264
37		Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe: Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264
36		Pierre Fraigniaud, Cyril Gavoille: A Space Lower Bound for Routing in Trees. STACS 2002: 65-75
35		Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille: Recognizing Knödel graphs. Discrete Mathematics 250(1-3): 41-62 (2002)
	2001
34		Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg: Approximate Distance Labeling Schemes. ESA 2001: 476-487
33		Pierre Fraigniaud, Cyril Gavoille: Routing in Trees. ICALP 2001: 757-772
32		Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz: Distance labeling in graphs. SODA 2001: 210-219
31		Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena: Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216
30		Pierre Fraigniaud, Cyril Gavoille, Bernard Mans: Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing 14(4): 217-229 (2001)
29		Cyril Gavoille, Christophe Paul: Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electronic Notes in Discrete Mathematics 10: 117-120 (2001)
28		Cyril Gavoille, Marc Gengler: Space-Efficiency for Routing Schemes of Stretch Factor Three. J. Parallel Distrib. Comput. 61(5): 679-687 (2001)
27		Cyril Gavoille, David Peleg: The Compactness of Interval Routing for Almost All Graphs. SIAM J. Comput. 31(3): 706-721 (2001)
26		Cyril Gavoille: Routing in distributed networks: overview and open problems. SIGACT News 32(1): 36-52 (2001)
	2000
25		Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson: On Recognizing Cayley Graphs. ESA 2000: 76-87
24		Pierre Fraigniaud, Cyril Gavoille, Bernard Mans: Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC 2000: 11-20
23		Cyril Gavoille, Akka Zemmari: The compactness of adaptive routing tables. SIROCCO 2000: 127-139
22		Cyril Gavoille: On the Dilation of Interval Routing. Comput. J. 43(3): 243-249 (2000)
21		Cyril Gavoille, Christophe Paul: Approximate Distance Labeling Schemes. Electronic Notes in Discrete Mathematics 5: 134-137 (2000)
20		Cyril Gavoille: A survey on interval routing. Theor. Comput. Sci. 245(2): 217-253 (2000)
	1999
19		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
18		Cyril Gavoille, Nicolas Hanusse: Compact Routing Tables for Graphs of Bounded Genus. ICALP 1999: 351-360
17		Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille: Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG 1999: 215-227
16		Cyril Gavoille, David Peleg: The Compactness of Interval Routing. SIAM J. Discrete Math. 12(4): 459-473 (1999)
	1998
15		Cyril Gavoille, David Peleg: The Compactness of Interval Routing for Almost All Graphs. DISC 1998: 161-174
14		Tamar Eilam, Cyril Gavoille, David Peleg: Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC 1998: 11-20
13		Pierre Fraigniaud, Cyril Gavoille: A Theoretical Model for Routing Complexity. SIROCCO 1998: 98-113
12		Pierre Fraigniaud, Cyril Gavoille: Interval Routing Schemes. Algorithmica 21(2): 155-182 (1998)
11		Cyril Gavoille, Eric Guévremont: Worst Case Bounds for Shortest Path Interval Routing. J. Algorithms 27(1): 1-25 (1998)
	1997
10		Cyril Gavoille: On the Dilation of Interval Routing. MFCS 1997: 259-268
9		Cyril Gavoille, Marc Gengler: An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. SIROCCO 1997: 162-175
8		Pierre Fraigniaud, Cyril Gavoille: Universal Routing Schemes. Distributed Computing 10(2): 65-78 (1997)
	1996
7		Cyril Gavoille, Stephane Perennes: Memory Requirements for Routing in Distributed Networks (Extended Abstract). PODC 1996: 125-133
6		Cyril Gavoille, Stephane Perennes: Lower Bounds for Shortest Path Interval Routing. SIROCCO 1996: 88-103
5		Pierre Fraigniaud, Cyril Gavoille: Local Memory Requirement of Universal Routing Schemes. SPAA 1996: 183-188
	1995
4		Pierre Fraigniaud, Cyril Gavoille: Memory Requirement for Universal Routing Schemes. PODC 1995: 223-230
3		Cyril Gavoille, Eric Guévremont: On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. SIROCCO 1995: 113-121
	1994
2		Pierre Fraigniaud, Cyril Gavoille: Optimal Interval Routing. CONPAR 1994: 785-796
1		Pierre Fraigniaud, Cyril Gavoille: A Characterization of Networks Supporting Linear Interval Routing. PODC 1994: 216-224

Coauthor Index

1	Ittai Abraham	[50] [53] [61] [65] [66] [69] [71] [76] [89] [101] [105] [116] [119]
2	Samson Abramsky	[108] [109]
3	Stephen Alstrup	[37]
4	Lali Barrière	[25]
5	Fabrice Bazzaro	[56] [59] [98]
6	Jean-Claude Bermond	[19]
7	Nicolas Bonichon	[43] [44] [49] [55] [57] [62] [67] [73] [103] [106] [113] [118]
8	Shiri Chechik	[105] [119]
9	Johanne Cohen	[17] [35]
10	Bruno Courcelle	[86] [88] [92] [111]
11	Bilel Derbel	[68] [83] [84] [91] [100]
12	Youssou Dieng	[95] [110]
13	Emilie Diot	[96] [107]
14	Yon Dourisboure	[38] [51] [72] [74]
15	Feodor F. Dragan	[72]
16	Tamar Eilam	[14] [40] [75]
17	Pierre Fraigniaud	[1] [2] [4] [5] [8] [12] [13] [17] [24] [25] [30] [33] [35] [36] [47] [52] [63] [64] [77] [80] [90] [93] [97] [117]
18	Marc Gengler	[9] [28]
19	Quentin Godfroy	[104] [112] [115]
20	Andrew V. Goldberg	[71]
21	Eric Guévremont	[3] [11]
22	Nicolas Hanusse	[18] [43] [44] [49] [55] [62] [87] [103] [106] [113] [118]
23	Friedhelm Meyer auf der Heide	[108] [109]
24	David Ilcinkas	[80] [97] [103]
25	Mamadou Moustapha Kanté	[86] [88] [92] [111]
26	Haim Kaplan	[37]
27	Michal Katz	[34]
28	Nir A. Katz	[34]
29	Claude Kirchner	[108] [109]
30	Ralf Klasing	[82] [94]
31	Adrian Kosowski	[77] [82] [93] [94] [99]
32	Lukasz Kuszner	[94]
33	Arnaud Labourel	[57] [67] [73] [78] [79] [81]
34	Emmanuelle Lebhar	[77] [93]
35	Zvi Lotker	[77] [93]
36	Olivier Ly	[60]
37	Dahlia Malkhi (Dalia Malki)	[50] [53] [61] [65] [66] [71] [76] [89] [101]
38	Bernard Mans	[24] [25] [30]
39	Marcin Markiewicz	[99]
40	Alfredo Navarra	[82] [94]
41	Martin Nehéz	[45] [54]
42	Noam Nisan	[50] [89]
43	Boaz Patt-Shamir	[102]
44	Christophe Paul	[21] [29] [34] [42] [46] [52] [63] [85]
45	Andrzej Pelc	[80] [97]
46	David Peleg	[14] [15] [16] [27] [31] [32] [34] [40] [41] [48] [75] [83] [91] [100] [105]
47	Stéphane Pérennes (Stephane Perennes)	[6] [7] [32] [48]
48	Ljubomir Perkovic	[106] [118]
49	Dominique Poulalhon	[49] [62]
50	André Raspaud	[19] [31]
51	Theis Rauhe	[37]
52	Ran Raz	[32] [48]
53	John Michael Robson	[25]
54	Gilles Schaeffer	[49] [62]
55	Christian Scheideler	[102]
56	Christian Sommer	[114]
57	Eric Sopena	[31]
58	Paul G. Spirakis	[108] [109]
59	Mikkel Thorup	[50] [89]
60	Andrew Twigg	[86]
61	Laurent Viennot	[91] [100] [104] [112] [115]
62	Udi Wieder	[76] [101]
63	Chenyu Yan	[72]
64	Akka Zemmari	[23] [39]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page