1. On sparse spanners of weighted graphs;Althöfer;Discrete Comput. Geom.,1993
2. New sparseness results on graph spanners;Chandra;Proc. ACM Symp. on Computational Geometry,1992
3. There is a planar graph almost as good as the complete graph;Chew;Proc. ACM Symp. on Computational Geometry,1986
4. Optimally sparse spanners in 3-dimensional Euclidean space;Das;Proc. ACM Symp. on Computational Geometry,1993
5. Delaunay graphs are almost as good as complete graphs;Dobkin;Discrete Comput. Geom.,1990