Lenhof, Hans-Peter Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Smid, Michiel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Lenhof, H.-P., & Smid, M. (1995). Sequential and Parallel Algorithms for the k Closest Pairs Problem. International Journal of Computational Geometry and Applications, 5(3), 273-288. doi:10.1142/S0218195995000167.