Cyril Gavoille - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Compact labelings for efficient first-order model-checkingBruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté. jco, 21(1):19-46, 2011. [doi]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011Cyril Gavoille, Pierre Fraigniaud, editors, ACM, 2011.

Sparse spanners vs. compact routingCyril Gavoille, Christian Sommer 0002. spaa 2011: 225-234 [doi]

2010

Forbidden-set distance labels for graphs of bounded doubling dimensionIttai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg. podc 2010: 192-200 [doi]

Strong-Diameter Decompositions of Minor Free GraphsIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder. mst, 47(4):837-855, 2010. [doi]

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part IISamson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis, editors, Volume 6199 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part ISamson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis, editors, Volume 6198 of Lecture Notes in Computer Science, Springer, 2010. [doi]

Plane Spanners of Maximum Degree SixNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. icalp 2010: 19-30 [doi]

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal SurfacesNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. wg 2010: 266-278 [doi]

Path Separability of GraphsEmilie Diot, Cyril Gavoille. faw 2010: 262-273 [doi]

Multipath SpannersCyril Gavoille, Quentin Godfroy, Laurent Viennot. sirocco 2010: 211-223 [doi]

ForewordCyril Gavoille, Boaz Patt-Shamir, Christian Scheideler. mst, 47(4):809-810, 2010. [doi]

2009

Localized and compact data-structure for comparability graphsFabrice Bazzaro, Cyril Gavoille. DM, 309(11):3465-3484, 2009. [doi]

Local Computation of Nearly Additive SpannersBilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot. wdag 2009: 176-190 [doi]

On the Tree-Width of Planar GraphsYoussou Dieng, Cyril Gavoille. endm, 34:593-596, 2009. [doi]

On the Path Separability of Planar GraphsEmilie Diot, Cyril Gavoille. endm, 34:549-552, 2009. [doi]

Universal augmentation schemes for network navigabilityPierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker. TCS, 410(21-23):1970-1981, 2009. [doi]

Distributed computing with advice: information sensitivity of graph coloringPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. dc, 21(6):395-403, 2009. [doi]

What Can Be Observed Locally?Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz. wdag 2009: 243-257 [doi]

On the complexity of distributed graph coloring with local minimality constraintsCyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra. networks, 54(1):12-19, 2009. [doi]

2008

Compact name-independent routing with minimum stretchIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. talg, 4(3), 2008. [doi]

Connectivity check in 3-connected planar graphs with obstaclesBruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg. endm, 31:151-155, 2008. [doi]

Efficient First-Order Model-Checking Using Short LabelsBruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté. faw 2008: 159-170 [doi]

On the locality of distributed sparse spanner constructionBilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot. podc 2008: 273-282 [doi]

Fast deterministic distributed algorithms for sparse spannersBilel Derbel, Cyril Gavoille. TCS, 399(1-2):83-100, 2008. [doi]

Polylogarithmic network navigability using compact metrics with small stretchPierre Fraigniaud, Cyril Gavoille. spaa 2008: 62-69 [doi]

On Compact Encoding of PagenumberCyril Gavoille, Nicolas Hanusse. dmtcs, 10(3), 2008. [doi]

Optimal Distance Labeling for Interval Graphs and Related Graph FamiliesCyril Gavoille, Christophe Paul. siamdm, 22(3):1239-1258, 2008. [doi]

2007

Strong-diameter decompositions of minor free graphsIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder. spaa 2007: 16-24 [doi]

Short Labels by Traversal and JumpingNicolas Bonichon, Cyril Gavoille, Arnaud Labourel. endm, 28:153-160, 2007. [doi]

Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic TimeBilel Derbel, Cyril Gavoille, David Peleg. wdag 2007: 179-192 [doi]

Tree-decompositions with bags of small diameterYon Dourisboure, Cyril Gavoille. DM, 307(16):2008-2029, 2007. [doi]

Spanners for bounded tree-length graphsYon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan. TCS, 383(1):34-44, 2007. [doi]

Average stretch analysis of compact routing schemesTamar Eilam, Cyril Gavoille, David Peleg. DAM, 155(5):598-610, 2007. [doi]

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrierPierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker. spaa 2007: 1-7 [doi]

Distributed Computing with Advice: Information Sensitivity of Graph ColoringPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. icalp 2007: 231-242 [doi]

Distributed Relationship Schemes for TreesCyril Gavoille, Arnaud Labourel. isaac 2007: 728-738 [doi]

On the Complexity of Distributed Greedy ColoringCyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra. wdag 2007: 482-484 [doi]

On local representation of distances in treesCyril Gavoille, Arnaud Labourel. podc 2007: 352-353 [doi]

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth GraphsCyril Gavoille, Arnaud Labourel. esa 2007: 582-593 [doi]

2006

On space-stretch trade-offs: lower boundsIttai Abraham, Cyril Gavoille, Dahlia Malkhi. spaa 2006: 207-216 [doi]

On space-stretch trade-offs: upper boundsIttai Abraham, Cyril Gavoille, Dahlia Malkhi. spaa 2006: 217-224 [doi]

Routing in Networks with Low Doubling DimensionIttai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi. icdcs 2006: 75 [doi]

Object location using path separatorsIttai Abraham, Cyril Gavoille. podc 2006: 188-197 [doi]

Short Labels by Traversal and JumpingNicolas Bonichon, Cyril Gavoille, Arnaud Labourel. sirocco 2006: 143-156 [doi]

Planar Graphs, via Well-Orderly Maps and TreesNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. gc, 22(2):185-202, 2006. [doi]

Fast Deterministic Distributed Algorithms for Sparse SpannersBilel Derbel, Cyril Gavoille. sirocco 2006: 100-114 [doi]

Header-size lower bounds for end-to-end communication in memoryless networksPierre Fraigniaud, Cyril Gavoille. cn, 50(10):1630-1638, 2006. [doi]

Eclecticism shrinks even small worldsPierre Fraigniaud, Cyril Gavoille, Christophe Paul. dc, 18(4):279-291, 2006. [doi]

Distributed Data Structures: A Survey on Informative Labeling SchemesCyril Gavoille. mfcs 2006: 38 [doi]

2005

Compact Routing for Graphs Excluding a Fixed MinorIttai Abraham, Cyril Gavoille, Dahlia Malkhi. wdag 2005: 442-456 [doi]

Distance Labeling for Permutation GraphsFabrice Bazzaro, Cyril Gavoille. endm, 22:461-467, 2005. [doi]

Localized and Compact Data-Structure for Comparability GraphsFabrice Bazzaro, Cyril Gavoille. isaac 2005: 1122-1131 [doi]

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and GenerationNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. jgaa, 9(2):185-204, 2005. [doi]

Edge Partition of Toroidal Graphs into Forests in Linear TimeNicolas Bonichon, Cyril Gavoille, Arnaud Labourel. endm, 22:421-425, 2005. [doi]

Interval routing in reliability networksCyril Gavoille, Martin Nehéz. TCS, 333(3):415-432, 2005. [doi]

Distance Labeling in Hyperbolic GraphsCyril Gavoille, Olivier Ly. isaac 2005: 1071-1079 [doi]

Distributed Data Structures: A SurveyCyril Gavoille. sirocco 2005: 2 [doi]

2004

2003

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and GenerationNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. criwg 2003: 81-92 [doi]

An Information-Theoretic Upper Bound of Planar Graphs Using TriangulationNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. STACS 2003: 499-510 [doi]

Compact routing schemes with low stretch factorTamar Eilam, Cyril Gavoille, David Peleg. jal, 46(2):97-114, 2003. [doi]

Lower Bounds for Oblivious Single-Packet End-to-End CommunicationPierre Fraigniaud, Cyril Gavoille. wdag 2003: 211-223 [doi]

Distance labeling scheme and split decompositionCyril Gavoille, Christophe Paul. DM, 273(1-3):115-130, 2003. [doi]

Interval Routing in Reliability NetworksCyril Gavoille, Martin Nehéz. sirocco 2003: 147-162

The compactness of adaptive routing tablesCyril Gavoille, Akka Zemmari. jda, 1(2):237-254, 2003. [doi]

Optimal Distance Labeling for Interval and Circular-Arc GraphsCyril Gavoille, Christophe Paul. esa 2003: 254-265 [doi]

Compact and localized distributed data structuresCyril Gavoille, David Peleg. dc, 16(2-3):111-120, 2003. [doi]

2002

2001

Routing in TreesPierre Fraigniaud, Cyril Gavoille. icalp 2001: 757-772 [doi]

Interval routing schemes allow broadcasting with linear message-complexityPierre Fraigniaud, Cyril Gavoille, Bernard Mans. dc, 14(4):217-229, 2001. [doi]

Approximate Distance Labeling SchemesCyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg. esa 2001: 476-487 [doi]

Space-Efficiency for Routing Schemes of Stretch Factor ThreeCyril Gavoille, Marc Gengler. jpdc, 61(5):679-687, 2001. [doi]

Routing in distributed networks: overview and open problemsCyril Gavoille. sigact, 32(1):36-52, 2001. [doi]

Small k-Dominating Sets in Planar Graphs with ApplicationsCyril Gavoille, David Peleg, André Raspaud, Eric Sopena. criwg 2001: 201-216 [doi]

Distance labeling in graphsCyril Gavoille, David Peleg, Stephane Perennes, Ran Raz. soda 2001: 210-219 [doi]

The Compactness of Interval Routing for Almost All GraphsCyril Gavoille, David Peleg. siamcomp, 31(3):706-721, 2001. [doi]

Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary GraphsCyril Gavoille, Christophe Paul. endm, 10:117-120, 2001. [doi]

2000

1999

1998

Compact Routing Schemes with Low Stretch Factor (Extended Abstract)Tamar Eilam, Cyril Gavoille, David Peleg. podc 1998: 11-20 [doi]

Interval Routing SchemesPierre Fraigniaud, Cyril Gavoille. algorithmica, 21(2):155-182, 1998.

Worst Case Bounds for Shortest Path Interval RoutingCyril Gavoille, Eric Guévremont. jal, 27(1):1-25, 1998.

The Compactness of Interval Routing for Almost All GraphsCyril Gavoille, David Peleg. wdag 1998: 161-174 [doi]

PreviousNext