Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Minimum spanning trees in d dimensions
Nordic Journal of Computing
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Well-separated pair decomposition in linear time?
Information Processing Letters
Hi-index | 0.00 |