Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Optimally sparse spanners in 3-dimensional Euclidean space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Generating low-degree 2-spanners
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tree-Approximations for the Weighted Cost-Distance Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |