The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Cyril Gavoille: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Fraigniaud, Cyril Gavoille
    Optimal Interval Routing. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1994, pp:785-796 [Conf]
  2. Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson
    On Recognizing Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:76-87 [Conf]
  3. Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
    Approximate Distance Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:476-487 [Conf]
  4. Cyril Gavoille, Christophe Paul
    Optimal Distance Labeling for Interval and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:254-265 [Conf]
  5. Pierre Fraigniaud, Cyril Gavoille
    Routing in Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:757-772 [Conf]
  6. Cyril Gavoille, Nicolas Hanusse
    Compact Routing Tables for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:351-360 [Conf]
  7. Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
    Routing in Networks with Low Doubling Dimension. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:75- [Conf]
  8. Fabrice Bazzaro, Cyril Gavoille
    Localized and Compact Data-Structure for Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1122-1131 [Conf]
  9. Cyril Gavoille, Olivier Ly
    Distance Labeling in Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1071-1079 [Conf]
  10. Cyril Gavoille
    Distributed Data Structures: A Survey on Informative Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:38- [Conf]
  11. Cyril Gavoille
    On the Dilation of Interval Routing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:259-268 [Conf]
  12. Ittai Abraham, Cyril Gavoille
    Object location using path separators. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:188-197 [Conf]
  13. Pierre Fraigniaud, Cyril Gavoille
    A Characterization of Networks Supporting Linear Interval Routing. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:216-224 [Conf]
  14. Pierre Fraigniaud, Cyril Gavoille
    Memory Requirement for Universal Routing Schemes. [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:223-230 [Conf]
  15. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
    Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:11-20 [Conf]
  16. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
    Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:169-178 [Conf]
  17. Tamar Eilam, Cyril Gavoille, David Peleg
    Compact Routing Schemes with Low Stretch Factor (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:11-20 [Conf]
  18. Cyril Gavoille, Stephane Perennes
    Memory Requirements for Routing in Distributed Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:125-133 [Conf]
  19. Pierre Fraigniaud, Cyril Gavoille
    A Theoretical Model for Routing Complexity. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:98-113 [Conf]
  20. Cyril Gavoille
    Distributed Data Structures: A Survey. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:2- [Conf]
  21. Cyril Gavoille, Eric Guévremont
    On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:113-121 [Conf]
  22. Cyril Gavoille, Marc Gengler
    An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:162-175 [Conf]
  23. Cyril Gavoille, Martin Nehéz
    Interval Routing in Reliability Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:147-162 [Conf]
  24. Cyril Gavoille, Stephane Perennes
    Lower Bounds for Shortest Path Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:88-103 [Conf]
  25. Bilel Derbel, Cyril Gavoille
    Fast Deterministic Distributed Algorithms for Sparse Spanners. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:100-114 [Conf]
  26. Yon Dourisboure, Cyril Gavoille
    Sparse Additive Spanners for Bounded Tree-Length Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:123-137 [Conf]
  27. Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
    Short Labels by Traversal and Jumping. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:143-156 [Conf]
  28. Cyril Gavoille, Akka Zemmari
    The compactness of adaptive routing tables. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:127-139 [Conf]
  29. Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:210-219 [Conf]
  30. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
    On space-stretch trade-offs: lower bounds. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:207-216 [Conf]
  31. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
    On space-stretch trade-offs: upper bounds. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:217-224 [Conf]
  32. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
    Compact name-independent routing with minimum stretch. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:20-24 [Conf]
  33. Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
    Nearest common ancestors: a survey and a new distributed algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:258-264 [Conf]
  34. Pierre Fraigniaud, Cyril Gavoille
    Local Memory Requirement of Universal Routing Schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:183-188 [Conf]
  35. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
    An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:499-510 [Conf]
  36. Pierre Fraigniaud, Cyril Gavoille
    A Space Lower Bound for Routing in Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:65-75 [Conf]
  37. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
    Routing with Improved Communication-Space Trade-Off. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:305-319 [Conf]
  38. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
    Compact Routing for Graphs Excluding a Fixed Minor. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:442-456 [Conf]
  39. Pierre Fraigniaud, Cyril Gavoille
    Lower Bounds for Oblivious Single-Packet End-to-End Communication. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:211-223 [Conf]
  40. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing for Almost All Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:161-174 [Conf]
  41. Yon Dourisboure, Cyril Gavoille
    Improved Compact Routing Scheme for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:252-264 [Conf]
  42. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
    Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:81-92 [Conf]
  43. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
    Planar Graphs, via Well-Orderly Maps and Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:270-284 [Conf]
  44. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
    Recognizing Bipartite Incident-Graphs of Circulant Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:215-227 [Conf]
  45. Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
    Small k-Dominating Sets in Planar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:201-216 [Conf]
  46. Pierre Fraigniaud, Cyril Gavoille
    Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:2, pp:155-182 [Journal]
  47. Cyril Gavoille
    On the Dilation of Interval Routing. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2000, v:43, n:3, pp:243-249 [Journal]
  48. Pierre Fraigniaud, Cyril Gavoille
    Header-size lower bounds for end-to-end communication in memoryless networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2006, v:50, n:10, pp:1630-1638 [Journal]
  49. Tamar Eilam, Cyril Gavoille, David Peleg
    Average stretch analysis of compact routing schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:5, pp:598-610 [Journal]
  50. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
    Interval routing schemes allow broadcasting with linear message-complexity. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:4, pp:217-229 [Journal]
  51. Pierre Fraigniaud, Cyril Gavoille
    Universal Routing Schemes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1997, v:10, n:2, pp:65-78 [Journal]
  52. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
    Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:279-291 [Journal]
  53. Cyril Gavoille, David Peleg
    Compact and localized distributed data structures. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:111-120 [Journal]
  54. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
    Recognizing Knödel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:41-62 [Journal]
  55. Cyril Gavoille, Christophe Paul
    Distance labeling scheme and split decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:115-130 [Journal]
  56. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
    Planar Graphs, via Well-Orderly Maps and Trees. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:2, pp:185-202 [Journal]
  57. Tamar Eilam, Cyril Gavoille, David Peleg
    Compact routing schemes with low stretch factor. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:46, n:2, pp:97-114 [Journal]
  58. Cyril Gavoille, Eric Guévremont
    Worst Case Bounds for Shortest Path Interval Routing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:1, pp:1-25 [Journal]
  59. Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:1, pp:85-112 [Journal]
  60. Cyril Gavoille, Akka Zemmari
    The compactness of adaptive routing tables. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:2, pp:237-254 [Journal]
  61. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
    Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:2, pp:185-204 [Journal]
  62. Cyril Gavoille, Marc Gengler
    Space-Efficiency for Routing Schemes of Stretch Factor Three. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:5, pp:679-687 [Journal]
  63. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing for Almost All Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:706-721 [Journal]
  64. Cyril Gavoille, David Peleg
    The Compactness of Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:459-473 [Journal]
  65. Cyril Gavoille
    A survey on interval routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:217-253 [Journal]
  66. Cyril Gavoille, Martin Nehéz
    Interval routing in reliability networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:415-432 [Journal]
  67. Cyril Gavoille, Arnaud Labourel
    Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:582-593 [Conf]
  68. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
    Distributed Computing with Advice: Information Sensitivity of Graph Coloring. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:231-242 [Conf]
  69. Cyril Gavoille, Arnaud Labourel
    On local representation of distances in trees. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:352-353 [Conf]
  70. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
    Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:1-7 [Conf]
  71. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
    Strong-diameter decompositions of minor free graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:16-24 [Conf]
  72. Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra
    On the Complexity of Distributed Greedy Coloring. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:482-484 [Conf]
  73. Bilel Derbel, Cyril Gavoille, David Peleg
    Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:179-192 [Conf]
  74. Yon Dourisboure, Cyril Gavoille
    Tree-decompositions with bags of small diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2008-2029 [Journal]
  75. Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan
    Spanners for bounded tree-length graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:34-44 [Journal]

  76. Plane Spanners of Maximum Degree Six. [Citation Graph (, )][DBLP]


  77. Distributed Relationship Schemes for Trees. [Citation Graph (, )][DBLP]


  78. On the locality of distributed sparse spanner construction. [Citation Graph (, )][DBLP]


  79. Forbidden-set distance labels for graphs of bounded doubling dimension. [Citation Graph (, )][DBLP]


  80. Multipath Spanners. [Citation Graph (, )][DBLP]


  81. Polylogarithmic network navigability using compact metrics with small stretch. [Citation Graph (, )][DBLP]


  82. What Can Be Observed Locally? [Citation Graph (, )][DBLP]


  83. Local Computation of Nearly Additive Spanners. [Citation Graph (, )][DBLP]


  84. Efficient First-Order Model-Checking Using Short Labels. [Citation Graph (, )][DBLP]


  85. Path Separability of Graphs. [Citation Graph (, )][DBLP]


  86. Compact Labelings For Efficient First-Order Model-Checking [Citation Graph (, )][DBLP]


  87. Distributed computing with advice: information sensitivity of graph coloring. [Citation Graph (, )][DBLP]


  88. Localized and compact data-structure for comparability graphs. [Citation Graph (, )][DBLP]


  89. On Compact Encoding of Pagenumber. [Citation Graph (, )][DBLP]


Search in 0.128secs, Finished in 0.131secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002