Recherche
-
Path Separability of Graphs
(2010-08)Document de travail - Pré-publication -
Remembering Without Memory: Tree Exploration by Asynchronous Oblivious Robots
(Theoretical Computer Science. vol. 411, n° 14-15, pp. 1583-1598, 2010-03)Article de revue -
Fast radio broadcasting with advice
(Theoretical Computer Science. vol. 411, n° 14-15, pp. 1544-1557, 2010-03)Article de revue -
Improved Approximations for TSP with Simple Precedence Constraints
Communication dans un congrès -
Dynamic Load Balancing with Pair Potentials
Communication dans un congrès -
[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