Towards tight bounds on theta-graphs: More is not always better

There are planar graphs almost as good as the complete graph

L. Paul Chew · Journal of Computer and System Sciences · 1989 · 272 citations

Computing, Computer Science, Mathematics +10

Approximation algorithms for shortest path motion planning

Kenneth L. Clarkson · 1987 · 262 citations · Full text

Computing, Computer Science, Algorithms +11

Proceedings of the 8th Canadian Conference on Computational Geometry

Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack · 1996 · 208 citations

Natural Sciences, Computer Science, Mathematics +14

On plane geometric spanners: A survey and open problems

Prosenjit Bose, Michiel Smid · Computational Geometry · 2013 · 83 citations

Natural Sciences, Mathematics, Computational Geometry +11

Competitive routing in the half-θ6-graph

Prosenjit Bose, Rolf Fagerberg, André van Renssen et al. · 2012 · 17 citations

Computing, Computer Science, Mathematics +12