Recherche
-
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Maximum matching in multi-interface networks
(Theoretical Computer Science. vol. 507, pp. 52-60, 2013)Article de revue -
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
(Theory of Computing Systems. vol. 52, n° 2, pp. 179-199, 2013)Article de revue -
Un algorithme parallèle pour l'extraction des bordures
Communication dans un congrès -
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 -
Optimal Exploration of Terrains with Obstacles
(2009-12-18)Autre document -
On Space-Stretch Trade-Offs: Upper Bounds
Communication dans un congrès