Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Strong Inapproximability of the Basic k-Spanner Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Tree Spanners for Subgraphs and Related Tree Covering Problems
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
Journal of Discrete Algorithms
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Approximating k-spanner problems for k 2
Theoretical Computer Science
Hi-index | 0.00 |