Mehlhorn, K.: SFB 124: VLSI-Entwurfsmethoden und Parallelität. In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, S. 3 - 29. Untitled Event, Hamburg, Germany, 17. Oktober 1988. Springer, Berlin, Germany (1988)

Mehlhorn, K.; Rülling, W.: Compaction on the Torus. In: {VLSI} algorithms and architectures: 3rd {A}egean Workshop on Computing, AWOC 88, S. 212 - 225. Untitled Event, Corfu, Greece, 28. Juni 1988. Springer, Berlin, Germany (1988)

Mehlhorn, K.; Yap, C.-K.: Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. In: Automata, languages and programming (ICALP-88): 15th international colloquium, S. 410 - 423. Untitled Event, Tampere, Finland, 11. Juli 1988. Springer, Berlin, Germany (1988)

Seidel, H.-P.: Automatic Detection of Closed Parametric Surfaces without Interior. In: Proceedings of the 9th European Computer Graphics Conference and Exhibition, S. 93 - 103 (Hg. Duce, D. A.; Jancène, P.). 9th European Computer Graphics Conference and Exhibition, Nice, France, 12. September 1988 - 16. September 1988. North-Holland / Eurographics Association (1988)

Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P.: Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. In: Parallel Algorithms and Architectures, S. 11 - 15. International Workshop on Parallel Algorithms and Architectures, Suhl, FRG, 25. Mai 1987. Springer, Berlin (1987)

Alt, H.; Mehlhorn, K.; Wagener, H.; Welzl, E.: Convergence, Similarity and Symmetries of Geometric Objects. In: Computational geometry (SCG-87): 3rd symposium, S. 308 - 315. Untitled Event, Waterloo, Canada, 08. Juni 1987. ACM, New York, USA (1987)

Kaufmann, M.; Mehlhorn, K.: On Local Routing of Two-Terminal Nets. In: STACS 87, S. 40 - 52 (Hg. Brandenburg, F. J.; Vidal-Naquet, G.; Wirsing, M.). 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, 19. Februar 1987 - 21. Februar 1987. Springer, Berlin, Germany (1987)

Mehlhorn, K.; Näher, S.; Alt, H.: A Lower Bound for the Complexity of the Union-Split-Find Problem. In: Automata, Languages and Programming (ICALP-87): 14th International Colloquium, S. 479 - 488. Untitled Event, Karlsruhe, Federal Republic of Germany, 13. Juli 1987. Springer, Berlin, Germany (1987)

Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P.: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), S. 199 - 208. Untitled Event, Bratislava, Czechoslovakia, 25. August 1986. Springer, Berlin, Germany (1986)

Fürer, M.; Mehlhorn, K.: AT$^2$-Optimal Galois Field Multiplier for VLSI. In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, S. 217 - 225. Untitled Event, Loutraki, Greece, 08. Juli 1986. Springer, Berlin, Germany (1986)

Mehlhorn, K.; Preparata, F. P.: Area-time Optimal Division for T=Omega(log n)$^1+epsilon$". In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, S. 341 - 352. Untitled Event, Orsay, France, 16. Januar 1986. Springer, Berlin, Germany (1986)

Fries, O.; Mehlhorn, K.; Näher, S.: Dynamization of geometric data structures. In: Computational geometry (SCG-85): 1st symposium, S. 168 - 176. Untitled Event, Baltimore, MD, USA, 05. Juni 1985. ACM, New York, USA (1985)

Hoffmann, K.; Mehlhorn, K.; Rosenstiehl, P.; Tarjan, R. E.: Sorting Jordan sequences in linear time. In: Computational geometry (SCG-85): 1st symposium, S. 196 - 203. Untitled Event, Baltimore, MD, USA, 05. Juni 1985. ACM, New York, USA (1985)

Mehlhorn, K.; Simon, K.: Intersecting Two Polyhedra One of which is Convex. In: Fundamentals of Computation Theory, S. 534 - 542 (Hg. Budach, L.). International Conference on Fundamentals of Computation Theory, Cottbus, GDR, 09. September 1985 - 13. September 1985. Springer, Berlin, Germany (1985)

Mehlhorn, K.; Tsakalidis, A. K.: Dynamic Interpolation Search. In: Automata, languages and programming (ICALP-85): 12th international colloquium, S. 424 - 434. Untitled Event, Nafplion, Greece, 15. Juli 1985. Springer, Berlin, Germany (1985)

Mehlhorn, K.; Tsakalidis, A. K.: Routing Through a Generalized Switchbox. In: Automata, languages and programming (ICALP-85): 12th international colloquium, S. 328 - 337. Untitled Event, Nafplion, Greece, 15. Juli 1985. Springer, Berlin, Germany (1985)

Lengauer, T.; Mehlhorn, K.: The HILL system: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts. In: Conference on Advanced Research in VLSI, S. 139 - 149 (Hg. Penfield, P.). 6th Conference on Advanced Research in VLSI, Cambridge, MA, USA, 23. Januar 1984 - 25. Januar 1984. Artech House, Dedham, Mass., USA (1984)

Mehlhorn, K.: Über Verdrahtungsalgorithmen. In: GI Jahrestagung (Fachgespräche), S. 79 - 89. Untitled Event, Braunschweig, Germany, 01. Oktober 1984. Springer, Berlin, Germany (1984)

Mehlhorn, K.: On Optimal VLSI-Circuits for the Basic Arithmetic Functions. In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), S. 23 - 30. Untitled Event, Bordeaux, France, 05. März 1984. Cambridge University Press, Cambridge, UK (1984)

Mehlhorn, K.; Preparata, F. P.: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. In: Automata, languages and programming (ICALP-84): 11th colloquium, S. 347 - 357. Untitled Event, Antwerp, Belgium, 16. Juli 1984. Springer, Berlin, Germany (1984)