Recherche
-
[Sans titre]
(2014-06-09)Document de travail - Pré-publication -
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Communication dans un congrès -
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations
Communication dans un congrès -
How to meet when you forget: log-space rendezvous in arbitrary graphs
(Distributed Computing. vol. 25, n° 2, pp. 165-178, 2012)Article de revue -
Graph Decomposition for Memoryless Periodic Exploration
(Algorithmica. vol. 63, n° 1-2, pp. 26-38, 2012)Article de revue -
PSEUDOE: A computational method to detect Psi-genes and explore PSEUDome dynamics in wine bacteria from the Oenococcus genus.
Communication dans un congrès -
A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity
Communication dans un congrès -
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Communication dans un congrès