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