Mehlhorn, K.; Näher, S.: Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Information Processing Letters 35 (4), S. 183 - 189 (1990)

Mehlhorn, K.; Näher, S.: A faster compaction algorithm with automatic jog insertion. IEEE Transactions on CAD of Integrated Circuits and Systems 9, S. 158 - 166 (1990)

Mehlhorn, K.; Näher, S.; Rauch, M.: On the Complexity of a Game Related to the Dictionary Problem. SIAM Journal on Computing 19 (5), S. 902 - 906 (1990)

Mehlhorn, K.; Näher, S.; Uhrig, C.: Hidden Line Elimination for Isooriented Rectangles. Information Processing Letters 35 (3), S. 137 - 143 (1990)

Mehlhorn, K.; Rülling, W.: Compaction on the Torus. IEEE Transactions on CAD of Integrated Circuits and Systems 9, S. 389 - 397 (1990)

Seidel, H.-P.: Symmetric Triangular Algorithms for Curves. Computer Aided Geometric Design 7 (1-4), S. 57 - 67 (1990)

Seidel, H.-P.: Quaternionen in Computergraphik und Robotik / Quaternions in Computer Graphics and Robotics. Information technology 32 (4), S. 266 - 275 (1990)

Furer, M.; Mehlhorn, K.: AT^2-Optimal Galois Field Multiplier for VLSI. IEEE Transactions on Computers 38 (9), S. 1333 - 1336 (1989)

Hagerup, T.; Chrobak, M.; Diks, K.: Optimal Parallel 5-Colouring of Planar Graphs. SIAM Journal on Computing 18 (2), S. 288 - 300 (1989)

Hagerup, T.; Rüb, C.: Optimal merging and sorting on the EREW PRAM. Information Processing Letters 33 (4), S. 181 - 185 (1989)

Seidel, H.-P.: A New Multiaffine Approach to B-splines. Computer Aided Geometric Design 6 (1), S. 23 - 32 (1989)

Alt, H.; Mehlhorn, K.; Wagener, H.; Welzl, E.: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete and Computational Geometry 3, S. 237 - 256 (1988)

Jung, H.; Mehlhorn, K.: Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Information Processing Letters 27 (5), S. 227 - 236 (1988)

Mehlhorn, K.: A Faster Approximation Algorithm for the Steiner Problem in Graphs. Information Processing Letters 27 (3), S. 125 - 128 (1988)

Mehlhorn, K.; Näher, S.; Alt, H.: A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing 17 (6), S. 1093 - 1102 (1988)

Seidel, H.-P.: Knot Insertion from a Blossoming Point of View. Computer Aided Geometric Design 5 (1), S. 81 - 86 (1988)

Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P.: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM Journal on Computing 16 (5), S. 808 - 835 (1987)

Fries, O.; Mehlhorn, K.; Näher, S.; Tsakalidis, A.: A log log n Data Structure for Three-sided Range Queries. Information Processing Letters 25 (4), S. 269 - 273 (1987)

Hagerup, T.: Towards Optimal Parallel Bucket Sorting. Information and Computation 75 (1), S. 39 - 51 (1987)

Mehlhorn, K.; Preparata, F. P.: Area-Time Optimal Division for T=Omega((log n)^1+epsilon). Information and Computation 72 (3), S. 270 - 282 (1987)