An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. - Christian Schwarz 002; Michiel H. M. Smid (SODA, 1992)

Maintaining the Approximate Width of a Set of Points in the Plane. - Günter Rote; Christian Schwarz 002; Jack Snoeyink (CCCG, 1993)

Static and Dynamic Algorithms for k-Point Clustering Problems. - Amitava Datta; Hans-Peter Lenhof; Christian Schwarz 002; Michiel H. M. Smid (WADS, 1993)

Data structures and algorithms for the dynamic closest pair problem. - Christian Schwarz 002 (1993)

An Optimal Algorithm for the On-Line Closest-Pair Problem. - Christian Schwarz 002; Michiel H. M. Smid; Jack Snoeyink (Algorithmica, 1994)

Minimal Enclosing Parallelogram with Application. - Christian Schwarz 002; Jürgen Teich; Alek Vainshtein; Emo Welzl; Brian L. Evans (SCG, 1995)

Static and Dynamic Algorithms for k-Point Clustering Problems. - Amitava Datta; Hans-Peter Lenhof; Christian Schwarz 002; Michiel H. M. Smid (J. Algorithms, 1995)

Simple Randomized Algorithms for Closest Pair Problems. - Mordecai J. Golin; Rajeev Raman; Christian Schwarz 002; Michiel H. M. Smid (Nord. J. Comput., 1995)

Randomized Data Structures for the Dynamic Closest-Pair Problem. - Mordecai J. Golin; Rajeev Raman; Christian Schwarz 002; Michiel H. M. Smid (SIAM J. Comput., 1998)