Recherche
-
Gathering radio messages in the path
(Discrete Mathematics, Algorithms and Applications. vol. 5, n° 1, pp. 1-28, 2013-03)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 -
Taking Advantage of Symmetries: Gathering of many Asynchronous Oblivious Robots on a Ring
(Theoretical Computer Science. vol. 411, n° 34--36, pp. 3235--3246, 2010-07)Article de revue -
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 -
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
(Internet Mathematics. vol. 2, n° 3, pp. 275--300, 2005)Article de revue -
On the size of identifying codes in triangle-free graphs
(Discrete Applied Mathematics. vol. 160, n° 10-11, pp. 1532-1546, 2012-07-01)Article de revue -
Derandomizing random walks in undirected graphs using locally fair exploration strategies
(Distributed Computing. vol. 24, n° 2, pp. 91-99, 2011)Article de revue -
Constructing Incremental Sequences in Graphs
(Algorithmic Operations Research. vol. 1, n° 2, pp. 1--7, 2006)Article de revue -
On k-Connectivity Problems with Sharpened Triangle Inequality
(Journal of Discrete Algorithms. vol. 6, n° 4, pp. 605--617, 2008)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
(Theoretical Computer Science. vol. 326, n° 1--3, pp. 137--153, 2004-10)Article de revue