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. (1992). Enumerating the k closest pairs optimally. In 33rd Annual Symposium on Foundations of Computer Science (FOCS92) (pp. 380-386). Los Alamitos: IEEE.