An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Proceedings of the 2003 ACM symposium on Applied computing
Minimum spanning tree with hop restrictions
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
On the characterization of the domination of a diameter-constrained network reliability model
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Maximizing total upload in latency-sensitive P2P applications
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Inapproximability of survivable networks
Theoretical Computer Science
Journal of Discrete Algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
A distributed protocol for the bounded-hops converge-cast in ad-hoc networks
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Approximating k-hop minimum-spanning trees
Operations Research Letters
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.05 |