Lower bounds for computing geometric spanners and approximate shortest paths

Geometric dilation of closed planar curves: New lower bounds

Computational Geometry: Theory and Applications

The Minimal Manhattan Network Problem in Three Dimensions

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Journal of Discrete Algorithms

I/O-Efficiently pruning dense spanners

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

A 1.5-approximation of the minimal manhattan network problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Sparse Euclidean Spanners with Tiny Diameter

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Optimal euclidean spanners: really short, thin and lanky

Proceedings of the forty-fifth annual ACM symposium on Theory of computing