Recherche
-
Gathering radio messages in the path
(Discrete Mathematics, Algorithms and Applications. vol. 5, n° 1, pp. 1-28, 2013-03)Article de revue -
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
(Algorithmica. vol. 65, n° 3, pp. 562-583, 2013-03)Article de revue -
Time versus space trade-offs for rendezvous in trees
(Distributed Computing. vol. 27, n° 2, pp. 95-109, 2014-04)Article de revue -
Worst-case optimal exploration of terrains with obstacles
(Information and Computation. vol. 225, pp. 16-28, 2013-04-01)Article de revue -
Partitioning a square into rectangles: NP-completeness and approximation algorithms
(Algorithmica. vol. 34, pp. 217-239, 2002)Article de revue -
More efficient periodic traversal in anonymous undirected graphs
(Theoretical Computer Science. vol. 444, pp. pages 60-76, 2012-07)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
(Algorithmica. vol. 62, n° 3-4, pp. pages 1006-1033, 2012-04)Article de revue -
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 -
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