Recherche
-
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
(Theoretical Computer Science. vol. 285, n° 1, pp. 3--24, 2002-08)Article de revue -
Tightening the upper bound for the Minimum Energy Broadcasting
(Wireless Networks. vol. 14, n° 5, pp. 659--669, 2008)Article de revue -
Improved approximation results for the Minimum Energy Broadcasting problem in Wireless Ad Hoc Networks
(Algorithmica. vol. 49, n° 4, pp. 318--336, 2007-12)Article de revue -
Improved approximation results for the Minimum Energy Broadcasting Problem
Communication dans un congrès -
Dominating Sets in Web Graphs
Communication dans un congrès -
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 -
On the Complexity of Distributed Graph Coloring with Local Minimality Constraints
(Networks. vol. 54, n° 1, pp. 12--19, 2009-08)Article de revue -
From Balls and Bins to Points and Vertices
(Algorithmic Operations Research. vol. 4, n° 2, pp. 133--143, 2009)Article de revue -
Approximation bounds for Black Hole Search problems
(Networks. vol. 52, n° 4, pp. 216--226, 2008-12)Article de revue -
On the Complexity of Bandwidth Allocation in Radio Networks
(Theoretical Computer Science. vol. 406, n° 3, pp. 225--239, 2008-10)Article de revue