Buscar
-
Gathering asynchronous oblivious mobile robots in a ring
(Theoretical Computer Science. vol. 390, n° 1, pp. 27--39, 2008-01)Article de revue -
Hardness and approximation results for black hole search in arbitrary graphs
(Theoretical Computer Science. vol. 384, n° 2-3, pp. 201-221, 2007-10)Article de revue -
Hardness and approximation results for black hole search in arbitrary graphs
Communication dans un congrès -
Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem
Communication dans un congrès -
Cost minimisation in multi-interface networks
Communication dans un congrès -
Gathering asynchronous oblivious mobile robots in a ring
Communication dans un congrès -
Hardness results and approximation algorithms of k-tuple domination in graphs
(Information Processing Letters. vol. 89, n° 2, pp. 75--83, 2004-01)Article de revue -
Fast Periodic Graph Exploration with Constant Memory
(Journal of Computer and System Sciences. vol. 74, n° 5, pp. 808--822, 2008)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 -
Fast Periodic Graph Exploration with Constant Memory
Communication dans un congrès