#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1988

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pierre Fraigniaud, Cyril Gavoille
- ICALP
- 2001

- Cyril Gavoille, David Peleg, StÃ©phane PÃ©rennes, Ran Raz
- SODA
- 2001

We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additionalâ€¦ (More)

- Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
- SPAA '02
- 2002

Several papers describe linear time algorithms to preprocess a tree, such that one can answer subsequent nearest common ancestor queries in constant time. Here, we survey these algorithms and relatedâ€¦ (More)

Î˜k-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor dependingâ€¦ (More)

- Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
- Theory of Computing Systems
- 2004

Several papers describe linear time algorithms to preprocess a tree, in order to answer subsequent nearest common ancestor queries in constant time. Here, we survey these algorithms and relatedâ€¦ (More)

- Yon Dourisboure, Cyril Gavoille
- Discrete Mathematics
- 2007

This paper deals with the length of a Robertsonâ€“Seymourâ€™s tree-decomposition. The tree-length of a graph is the largest distance between two vertices of a bag of a tree-decomposition, minimized overâ€¦ (More)

- Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
- 26th IEEE International Conference on Distributedâ€¦
- 2006

This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtained for this modelâ€¦ (More)

- Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
- Distributed Computing
- 2004

We consider small world graphs as defined by Kleinberg (2000), i.e., graphs obtained from a <i>d</i>-dimensional mesh by adding links chosen at random according to the <i>d</i>-harmonic distribution.â€¦ (More)

- Cyril Gavoille
- SIGACT News
- 2001

with group communication primitives. The proceedings of the conference were published by Springer in LNCS number 1914. They were edited by Maurice Herlihy who also chaired the program committee. Mostâ€¦ (More)

- Ittai Abraham, Cyril Gavoille
- PODC
- 2006

We study a novel separator property called <i>k-path separable</i>. Roughly speaking, a <i>k-path separable</i> graph can be recursively separated into smaller components by sequentially removingâ€¦ (More)