Paolo Ferragina and Roberto Grossi . Theoretical developments and experimental results. Quasi-greedy triangulations approximating the minimum weight triangulation. Joseph S. B. Mitchell . Hongyan Wang and Pankaj K. Agarwal .
Approximation algorithms for curvature-constrained shortest paths.
Esther M. Arkin , Martin Held , and Christopher L. Smith . Michele Zito , Ida Pu , Martyn Amos , and Alan Gibbons . RNC algorithms for the uniform generation of combinatorial structures. Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time.