Recherche
-
Improved Approximations for TSP with Simple Precedence Constraints
Communication dans un congrès -
Locating and repairing faults in a network with mobile agents
(Theoretical Computer Science. vol. 411, n° 14--15, pp. 1638--1647, 2010-03)Article de revue -
Robustness of the rotor-router mechanism
Communication dans un congrès -
Euler Tour Lock-in Problem in the Rotor-Router Model
Communication dans un congrès -
Gathering in specific radio networks
Communication dans un congrès -
Hardness and approximation of Gathering in static radio networks
Communication dans un congrès -
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Communication dans un congrès -
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Communication dans un congrès -
Brief Announcement: On the Complexity of Distributed Greedy Coloring
Communication dans un congrès -
From Balls and Bins to Points and Vertices
Communication dans un congrès