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
Communication dans un congrès -
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 -
Constructing Incremental Sequences in Graphs
(Algorithmic Operations Research. vol. 1, n° 2, pp. 1--7, 2006)Article de revue -
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks
(SIAM Journal on Discrete Mathematics. vol. 23, n° 3, pp. 1612--1645, 2009)Article de revue -
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
(Algorithmic Operations Research. vol. 3, n° 1, pp. 43-50, 2008)Article de revue