Hidden Line Elimination for Isooriented Rectangels. - Kurt Mehlhorn; Stefan Näher; Christian Uhrig (Inf. Process. Lett., 1990)

Selected Topics from Computational Geometry, Data Structures and Motion Planning. - Rudolf Fleischer; Otfried Fries; Kurt Mehlhorn; Stefan Meiser; Stefan Näher; Hans Rohnert; Stefan Schirra; Klaus Simon; Athanasios K. Tsakalidis; Christian Uhrig (Data Structures and Efficient Algorithms, 1992)

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. - Helmut Alt; Rudolf Fleischer; Michael Kaufmann 001; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (Algorithmica, 1992)

k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs - Kurt Mehlhorn; Wolfgang J. Paul; Christian Uhrig (Inf. Comput., 1992)

Lower and upper bounds for operations on sets. - Christian Uhrig (1993)

A Lower Bound for the Worst Case of Bottom-Up-Heapsort - Rudolf Fleischer; Bhabani P. Sinha; Christian Uhrig (Inf. Comput., 1993)

Exact Geometric Computation in LEDA. - Christoph Burnikel; Jochen Könemann; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (SCG, 1995)

Lower Bounds for Set Intersection Queries. - Paul F. Dietz; Kurt Mehlhorn; Rajeev Raman; Christian Uhrig (Algorithmica, 1995)

The LEDA Platform of Combinatorial and Geometric Computing. - Kurt Mehlhorn; Stefan Näher; Christian Uhrig (ICALP, 1997)

Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. - Kurt Mehlhorn; R. Sundar; Christian Uhrig (Algorithmica, 1997)

A computational basis for higher-dimensional computational geometry and applications. - Kurt Mehlhorn; Michael Müller 002; Stefan Näher; Stefan Schirra; Michael Seel; Christian Uhrig; Joachim Ziegler (Comput. Geom., 1998)

Checking geometric programs or verification of geometric structures. - Kurt Mehlhorn; Stefan Näher; Michael Seel; Raimund Seidel; Thomas Schilz; Stefan Schirra; Christian Uhrig (Comput. Geom., 1999)