dblp.uni-trier.dewww.uni-trier.de

Cyril Gavoille

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
90EEPierre 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
89EEBruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Efficient First-Order Model-Checking Using Short Labels. FAW 2008: 159-170
88EEBilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot: On the locality of distributed sparse spanner construction. PODC 2008: 273-282
87EEPierre Fraigniaud, Cyril Gavoille: Polylogarithmic network navigability using compact metrics with small stretch. SPAA 2008: 62-69
86EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3): (2008)
85EEBruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Compact Labelings For Efficient First-Order Model-Checking CoRR abs/0811.4713: (2008)
84EEBruno 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)
83EEBilel Derbel, Cyril Gavoille: Fast deterministic distributed algorithms for sparse spanners. Theor. Comput. Sci. 399(1-2): 83-100 (2008)
2007
82EEBilel Derbel, Cyril Gavoille, David Peleg: Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. DISC 2007: 179-192
81EECyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra: On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484
80EECyril Gavoille, Arnaud Labourel: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA 2007: 582-593
79EEPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242
78EECyril Gavoille, Arnaud Labourel: Distributed Relationship Schemes for Trees. ISAAC 2007: 728-738
77EECyril Gavoille, Arnaud Labourel: On local representation of distances in trees. PODC 2007: 352-353
76EEPierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker: Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA 2007: 1-7
75EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder: Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24
74EETamar Eilam, Cyril Gavoille, David Peleg: Average stretch analysis of compact routing schemes. Discrete Applied Mathematics 155(5): 598-610 (2007)
73EEYon Dourisboure, Cyril Gavoille: Tree-decompositions with bags of small diameter. Discrete Mathematics 307(16): 2008-2029 (2007)
72EENicolas Bonichon, Cyril Gavoille, Arnaud Labourel: Short Labels by Traversal and Jumping. Electronic Notes in Discrete Mathematics 28: 153-160 (2007)
71EEYon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383(1): 34-44 (2007)
2006
70EEIttai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi: Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75
69EECyril Gavoille: Distributed Data Structures: A Survey on Informative Labeling Schemes. MFCS 2006: 38
68EEIttai Abraham, Cyril Gavoille: Object location using path separators. PODC 2006: 188-197
67EEBilel Derbel, Cyril Gavoille: Fast Deterministic Distributed Algorithms for Sparse Spanners. SIROCCO 2006: 100-114
66EENicolas Bonichon, Cyril Gavoille, Arnaud Labourel: Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156
65EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi: On space-stretch trade-offs: lower bounds. SPAA 2006: 207-216
64EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi: On space-stretch trade-offs: upper bounds. SPAA 2006: 217-224
63EEPierre Fraigniaud, Cyril Gavoille: Header-size lower bounds for end-to-end communication in memoryless networks. Computer Networks 50(10): 1630-1638 (2006)
62EEPierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. Distributed Computing 18(4): 279-291 (2006)
61EENicolas 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
60EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi: Compact Routing for Graphs Excluding a Fixed Minor. DISC 2005: 442-456
59EECyril Gavoille, Olivier Ly: Distance Labeling in Hyperbolic Graphs. ISAAC 2005: 1071-1079
58EEFabrice Bazzaro, Cyril Gavoille: Localized and Compact Data-Structure for Comparability Graphs. ISAAC 2005: 1122-1131
57EECyril Gavoille: Distributed Data Structures: A Survey. SIROCCO 2005: 2
56EENicolas Bonichon, Cyril Gavoille, Arnaud Labourel: Edge Partition of Toroidal Graphs into Forests in Linear Time. Electronic Notes in Discrete Mathematics 22: 421-425 (2005)
55EEFabrice Bazzaro, Cyril Gavoille: Distance Labeling for Permutation Graphs. Electronic Notes in Discrete Mathematics 22: 461-467 (2005)
54EENicolas 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)
53EECyril Gavoille, Martin Nehéz: Interval routing in reliability networks. Theor. Comput. Sci. 333(3): 415-432 (2005)
2004
52EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi: Routing with Improved Communication-Space Trade-Off. DISC 2004: 305-319
51EEPierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. PODC 2004: 169-178
50EEYon Dourisboure, Cyril Gavoille: Sparse Additive Spanners for Bounded Tree-Length Graphs. SIROCCO 2004: 123-137
49EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. SPAA 2004: 20-24
48EENicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer: Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284
47EECyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz: Distance labeling in graphs. J. Algorithms 53(1): 85-112 (2004)
2003
46EEPierre Fraigniaud, Cyril Gavoille: Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC 2003: 211-223
45EECyril Gavoille, Christophe Paul: Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA 2003: 254-265
44 Cyril Gavoille, Martin Nehéz: Interval Routing in Reliability Networks. SIROCCO 2003: 147-162
43EENicolas Bonichon, Cyril Gavoille, Nicolas Hanusse: An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. STACS 2003: 499-510
42EENicolas Bonichon, Cyril Gavoille, Nicolas Hanusse: Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. WG 2003: 81-92
41EECyril Gavoille, Christophe Paul: Distance labeling scheme and split decomposition. Discrete Mathematics 273(1-3): 115-130 (2003)
40EECyril Gavoille, David Peleg: Compact and localized distributed data structures. Distributed Computing 16(2-3): 111-120 (2003)
39EETamar Eilam, Cyril Gavoille, David Peleg: Compact routing schemes with low stretch factor. J. Algorithms 46(2): 97-114 (2003)
38EECyril Gavoille, Akka Zemmari: The compactness of adaptive routing tables. J. Discrete Algorithms 1(2): 237-254 (2003)
2002
37EEYon Dourisboure, Cyril Gavoille: Improved Compact Routing Scheme for Chordal Graphs. DISC 2002: 252-264
36EEStephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe: Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264
35EEPierre Fraigniaud, Cyril Gavoille: A Space Lower Bound for Routing in Trees. STACS 2002: 65-75
34EEJohanne Cohen, Pierre Fraigniaud, Cyril Gavoille: Recognizing Knödel graphs. Discrete Mathematics 250(1-3): 41-62 (2002)
2001
33EECyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg: Approximate Distance Labeling Schemes. ESA 2001: 476-487
32EEPierre Fraigniaud, Cyril Gavoille: Routing in Trees. ICALP 2001: 757-772
31EECyril Gavoille, David Peleg, Stephane Perennes, Ran Raz: Distance labeling in graphs. SODA 2001: 210-219
30EECyril Gavoille, David Peleg, André Raspaud, Eric Sopena: Small k-Dominating Sets in Planar Graphs with Applications. WG 2001: 201-216
29EEPierre Fraigniaud, Cyril Gavoille, Bernard Mans: Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing 14(4): 217-229 (2001)
28EECyril Gavoille, Christophe Paul: Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electronic Notes in Discrete Mathematics 10: 117-120 (2001)
27EECyril Gavoille, Marc Gengler: Space-Efficiency for Routing Schemes of Stretch Factor Three. J. Parallel Distrib. Comput. 61(5): 679-687 (2001)
26EECyril Gavoille, David Peleg: The Compactness of Interval Routing for Almost All Graphs. SIAM J. Comput. 31(3): 706-721 (2001)
2000
25 Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson: On Recognizing Cayley Graphs. ESA 2000: 76-87
24EEPierre 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)
21EECyril Gavoille, Christophe Paul: Approximate Distance Labeling Schemes. Electronic Notes in Discrete Mathematics 5: 134-137 (2000)
20EECyril 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
18EECyril Gavoille, Nicolas Hanusse: Compact Routing Tables for Graphs of Bounded Genus. ICALP 1999: 351-360
17EEJohanne Cohen, Pierre Fraigniaud, Cyril Gavoille: Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG 1999: 215-227
16EECyril Gavoille, David Peleg: The Compactness of Interval Routing. SIAM J. Discrete Math. 12(4): 459-473 (1999)
1998
15EECyril Gavoille, David Peleg: The Compactness of Interval Routing for Almost All Graphs. DISC 1998: 161-174
14EETamar 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

1Ittai Abraham [49] [52] [60] [64] [65] [68] [70] [75] [86]
2Stephen Alstrup [36]
3Lali Barrière [25]
4Fabrice Bazzaro [55] [58]
5Jean-Claude Bermond [19]
6Nicolas Bonichon [42] [43] [48] [54] [56] [61] [66] [72]
7Johanne Cohen [17] [34]
8Bruno Courcelle [84] [85] [89]
9Bilel Derbel [67] [82] [83] [88]
10Yon Dourisboure [37] [50] [71] [73]
11Feodor F. Dragan [71]
12Tamar Eilam [14] [39] [74]
13Pierre Fraigniaud [1] [2] [4] [5] [8] [12] [13] [17] [24] [25] [29] [32] [34] [35] [46] [51] [62] [63] [76] [79] [87] [90]
14Marc Gengler [9] [27]
15Andrew V. Goldberg [70]
16Eric Guévremont [3] [11]
17Nicolas Hanusse [18] [42] [43] [48] [54] [61]
18David Ilcinkas [79]
19Mamadou Moustapha Kanté [84] [85] [89]
20Haim Kaplan [36]
21Michal Katz [33]
22Nir A. Katz [33]
23Ralf Klasing [81]
24Adrian Kosowski [76] [81] [90]
25Arnaud Labourel [56] [66] [72] [77] [78] [80]
26Emmanuelle Lebhar [76] [90]
27Zvi Lotker [76] [90]
28Olivier Ly [59]
29Dahlia Malkhi (Dalia Malki) [49] [52] [60] [64] [65] [70] [75] [86]
30Bernard Mans [24] [25] [29]
31Alfredo Navarra [81]
32Martin Nehéz [44] [53]
33Noam Nisan [49] [86]
34Christophe Paul [21] [28] [33] [41] [45] [51] [62]
35Andrzej Pelc [79]
36David Peleg [14] [15] [16] [26] [30] [31] [33] [39] [40] [47] [74] [82] [88]
37Stéphane Pérennes (Stephane Perennes) [6] [7] [31] [47]
38Dominique Poulalhon [48] [61]
39André Raspaud [19] [30]
40Theis Rauhe [36]
41Ran Raz [31] [47]
42John Michael Robson [25]
43Gilles Schaeffer [48] [61]
44Eric Sopena [30]
45Mikkel Thorup [49] [86]
46Andrew Twigg [84]
47Laurent Viennot [88]
48Udi Wieder [75]
49Chenyu Yan [71]
50Akka Zemmari [23] [38]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)