Cyril Gavoille

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2010
36Plane Spanners of Maximum Degree Six. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. ICALP (1) 2010, 19-30. Web SearchBibTeXDownload
35Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. WG 2010, 266-278. Web SearchBibTeXDownload
2009
34Distributed computing with advice: information sensitivity of graph coloring. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. Distributed Computing (21): 395-403 (2009). Web SearchBibTeXDownload
33Universal augmentation schemes for network navigability. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker. Theor. Comput. Sci. (410): 1970-1981 (2009). Web SearchBibTeXDownload
2008
32Compact name-independent routing with minimum stretch. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
31On Compact Encoding of Pagenumber. Cyril Gavoille, Nicolas Hanusse. Discrete Mathematics & Theoretical Computer Science (10) (2008). Web SearchBibTeXDownload
30Polylogarithmic network navigability using compact metrics with small stretch. Pierre Fraigniaud, Cyril Gavoille. SPAA 2008, 62-69. Web SearchBibTeXDownload
2007
29Distributed Computing with Advice: Information Sensitivity of Graph Coloring. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. ICALP 2007, 231-242. Web SearchBibTeXDownload
28Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker. SPAA 2007, 1-7. Web SearchBibTeXDownload
27Spanners for bounded tree-length graphs. Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan. Theor. Comput. Sci. (383): 34-44 (2007). Web SearchBibTeXDownload
2006
26Header-size lower bounds for end-to-end communication in memoryless networks. Pierre Fraigniaud, Cyril Gavoille. Computer Networks (50): 1630-1638 (2006). Web SearchBibTeXDownload
25Eclecticism shrinks even small worlds. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. Distributed Computing (18): 279-291 (2006). Web SearchBibTeXDownload
24Planar Graphs, via Well-Orderly Maps and Trees. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. Graphs and Combinatorics (22): 185-202 (2006). Web SearchBibTeXDownload
2005
23Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. J. Graph Algorithms Appl. (9): 185-204 (2005). Web SearchBibTeXDownload
2004
22Eclecticism shrinks even small worlds. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. PODC 2004, 169-178. Web SearchBibTeXDownload
21Compact name-independent routing with minimum stretch. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. SPAA 2004, 20-24. Web SearchBibTeXDownload
20Planar Graphs, via Well-Orderly Maps and Trees. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. WG 2004, 270-284. Web SearchBibTeXDownload
2003
19Lower Bounds for Oblivious Single-Packet End-to-End Communication. Pierre Fraigniaud, Cyril Gavoille. DISC 2003, 211-223. Web SearchBibTeXDownload
18An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. STACS 2003, 499-510. Web SearchBibTeXDownload
17Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. WG 2003, 81-92. Web SearchBibTeXDownload
2002
16Recognizing Knödel graphs. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille. Discrete Mathematics (250): 41-62 (2002). Web SearchBibTeXDownload
15Nearest common ancestors: a survey and a new distributed algorithm. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe. SPAA 2002, 258-264. Web SearchBibTeXDownload
14A Space Lower Bound for Routing in Trees. Pierre Fraigniaud, Cyril Gavoille. STACS 2002, 65-75. Web SearchBibTeXDownload
2001
13Interval routing schemes allow broadcasting with linear message-complexity. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans. Distributed Computing (14): 217-229 (2001). Web SearchBibTeXDownload
12Routing in Trees. Pierre Fraigniaud, Cyril Gavoille. ICALP 2001, 757-772. Web SearchBibTeXDownload
2000
11On Recognizing Cayley Graphs. Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson. ESA 2000, 76-87. Web SearchBibTeXDownload
10Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). Pierre Fraigniaud, Cyril Gavoille, Bernard Mans. PODC 2000, 11-20. Web SearchBibTeXDownload
1999
9Compact Routing Tables for Graphs of Bounded Genus. Cyril Gavoille, Nicolas Hanusse. ICALP 1999, 351-360. Web SearchBibTeXDownload
8Recognizing Bipartite Incident-Graphs of Circulant Digraphs. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille. WG 1999, 215-227. Web SearchBibTeXDownload
1998
7Interval Routing Schemes. Pierre Fraigniaud, Giorgio Gambosi, Sandro Salomone. Algorithmica (21): 155-182 (1998). Web SearchBibTeXDownload
6A Theoretical Model for Routing Complexity. Pierre Fraigniaud, Cyril Gavoille. SIROCCO 1998, 98-113. Web SearchBibTeX
1997
5Universal Routing Schemes. Pierre Fraigniaud, Cyril Gavoille. Distributed Computing (10): 65-78 (1997). Web SearchBibTeXDownload
1996
4Local Memory Requirement of Universal Routing Schemes. Pierre Fraigniaud, Cyril Gavoille. SPAA 1996, 183-188. Web SearchBibTeX
1995
3Memory Requirement for Universal Routing Schemes. Pierre Fraigniaud, Cyril Gavoille. PODC 1995, 223-230. Web SearchBibTeX
1994
2Optimal Interval Routing. Pierre Fraigniaud, Cyril Gavoille. CONPAR 1994, 785-796. Web SearchBibTeXDownload
1A Characterization of Networks Supporting Linear Interval Routing. Pierre Fraigniaud, Cyril Gavoille. PODC 1994, 216-224. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research