Wanted: Ph.D. Students in Algorithmics and Graph Theory at LaBRI
University Bordeaux, France

We are looking for a new member for our team "Combinatorics and
Algorithms" and for the INRIA project "CEPAGE" with a strong
algorithmic background, and a Master's degree in e.g. Computer Science
or Mathematics. The topics of this PhD position concern algorithms &
data-structures, distributed computing, and graph theory. In
particular, the following problem could be addressed:

- distance oracles, distance labeling
- compact routing schemes, labeling scheme
- sparse spanners, metric embedding, universal graphs

The position is available from Sep. 2009. The candidate must contact
Cyril Gavoille by email, joining:
- a CV;
- an introduction letter; and
- two contacts (lecturer or professor).

Best regards,