Kaufmann, M.; Mehlhorn, K.: Routing through a Generalized Switchbox. Journal of Algorithms 7 (4), pp. 510 - 531 (1986)

Mehlhorn, K.: Über Verdrahtungsalgorithmen. Informatik Spektrum 9 (4), pp. 227 - 234 (1986)

Mehlhorn, K.; Preparata, F. P.: Routing through a Rectangle. Journal of the ACM 33 (1), pp. 60 - 85 (1986)

Mehlhorn, K.; Preparata, F. P.; Sarrafzadeh, M.: Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1 (2), pp. 213 - 221 (1986)

Mehlhorn, K.; Schmidt, B. H.: On BF-orderable Graphs. Discrete applied mathematics 15 (2-3), pp. 315 - 327 (1986)

Mehlhorn, K.; Tsakalidis, A. K.: An Amortized Analysis of Insertions into AVL-Trees. SIAM Journal on Computing 15 (1), pp. 22 - 33 (1986)

Alt, H.; Mehlhorn, K.: Searching Semisorted Tables. SIAM Journal on Computing 14 (4), pp. 840 - 848 (1985)

Hertel, S.; Mehlhorn, K.: Fast Triangulation of the Plane with Respect to Simple Polygons. Information and Control 64 (1-3), pp. 52 - 76 (1985)

Mannila, H.; Mehlhorn, K.: A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Information Processing Letters 21 (5), pp. 269 - 272 (1985)

Alt, H.; Mehlhorn, K.; Munro, J. I.: Partial Match Retrieval in Implicit Data Structures. Information Processing Letters 19 (2), pp. 61 - 65 (1984)

Alt, H.; Mehlhorn, K.; Munro, J.: On the complexity of partial match retrieval. Information Processing Letters 19, pp. 61 - 65 (1984)

Hertel, S.; Mäntylä, M.; Mehlhorn, K.; Nievergelt, J.: Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica 21, pp. 501 - 519 (1984)

Hoffmann, K.; Mehlhorn, K.: Intersecting a line and a simple polygon. Eatcs Bulletin 22, pp. 120 - 121 (1984)

Lengauer, T.; Mehlhorn, K.: Four Results on the Complexity of VLSI Computation. Advances in Computing Research 2, pp. 1 - 22 (1984)

Mehlhorn, K.: AT²-optimal VLSI for Integer Division and Integer Square Rooting. Integration, the VLSI Journal 2 (2), pp. 163 - 167 (1984)

Mehlhorn, K.; Vishkin, U.: Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica 21, pp. 339 - 374 (1984)

Hong, J.-W.; Mehlhorn, K.; Rosenberg, A. L.: Cost Trade-offs in Graph Embeddings, with Applications. Journal of the ACM 30 (4), pp. 709 - 728 (1983)

Mehlhorn, K.; Preparata, F. P.: Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time. Information and Control 58 (1-3), pp. 137 - 156 (1983)

Mehlhorn, K.; Preparata, F. P.: $AT^2$-optimal VLSI multipliers with minimum computation time. Information & Control 58, pp. 137 - 196 (1983)

von Braunmühl, B.; Cook, S.; Mehlhorn, K.; Verbeek, R.: The Recognition of Deterministic CFL's in Small Time and Space. Information and Control 56 (1-2), pp. 34 - 51 (1983)