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, pp. 341 - 352. Untitled Event, Orsay, France, January 16, 1986. Springer, Berlin, Germany (1986)

Fries, O.; Mehlhorn, K.; Näher, S.: Dynamization of geometric data structures. In: Computational geometry (SCG-85): 1st symposium, pp. 168 - 176. Untitled Event, Baltimore, MD, USA, June 05, 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, pp. 196 - 203. Untitled Event, Baltimore, MD, USA, June 05, 1985. ACM, New York, USA (1985)

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

Mehlhorn, K.; Tsakalidis, A. K.: Dynamic Interpolation Search. In: Automata, languages and programming (ICALP-85): 12th international colloquium, pp. 424 - 434. Untitled Event, Nafplion, Greece, July 15, 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, pp. 328 - 337. Untitled Event, Nafplion, Greece, July 15, 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, pp. 139 - 149 (Ed. Penfield, P.). 6th Conference on Advanced Research in VLSI, Cambridge, MA, USA, January 23, 1984 - January 25, 1984. Artech House, Dedham, Mass., USA (1984)

Mehlhorn, K.: Über Verdrahtungsalgorithmen. In: GI Jahrestagung (Fachgespräche), pp. 79 - 89. Untitled Event, Braunschweig, Germany, October 01, 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), pp. 23 - 30. Untitled Event, Bordeaux, France, March 05, 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, pp. 347 - 357. Untitled Event, Antwerp, Belgium, July 16, 1984. Springer, Berlin, Germany (1984)

Hertel, S.; Mehlhorn, K.: Fast Triangulation of Simple Polygons. In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), pp. 207 - 218. Untitled Event, Borgholm, Sweden, August 21, 1983. Springer, Berlin, Germany (1983)

Lengauer, T.: Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout Compaction. In: Proceedings of the WG '83, pp. 219 - 230 (Eds. Nagl, M.; Perl, J.). International Workshop on Graphtheoretic Concepts in Computer Science, Osnabrück, Germany, June 16, 1983 - June 18, 1983. Trauner, Linz (1983)

Mehlhorn, K.; Schmidt, B. H.: A Single Shortest Path Algorithm for Graphs with Separators. In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), pp. 302 - 309. Untitled Event, Borgholm, Sweden, August 21, 1983. Springer, Berlin, Germany (1983)

Mehlhorn, K.: On the Program Size of Perfect and Universal Hash Functions. In: Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, pp. 170 - 175. 23th Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL, USA, November 03, 1982 - November 05, 1982. IEEE, New York, NY, USA (1982)

Mehlhorn, K.: Balanced Trees as a Datastructure for Representing Sorted Lists. In: Colloquium Complexiteit en Algoritmen, pp. 69 - 91 (Eds. Vitányi, P. M. B.; van Leeuwen, J.; van Emde Boas, P.). Colloquium Complexiteit en Algoritmen, Amsterdam, The Netherlands, 1982. Mathematisch Centrum, Amsterdam (1982)

Mehlhorn, K.; Schmidt, E. M.: Las Vegas Is better than Determinism in VLSI and Distributed Computing. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 330 - 337. Untitled Event, San Francisco, California, USA, May 05, 1982. ACM, Baltimore, MD, USA (1982)

Alt, H.; Mehlhorn, K.; Munro, J. I.: Partial Match Retrieval in Implicit Data Structures. In: Mathematical foundations of computer science (MFCS-81): 10th symposium, ,, pp. 156 - 161. Untitled Event, Strbské Pleso, Czechoslovakia, August 31, 1981. Springer, Berlin, Germany (1981)

Hong, J.-W.; Mehlhorn, K.; Rosenberg, A. L.: Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version). In: Automata, languages and programming (ICALP-81): 8th international colloquium, pp. 41 - 55. Untitled Event, Acre (Akko), Israel, July 13, 1981. Springer, Berlin, Germany (1981)

Huddleston, S.; Mehlhorn, K.: Robust balancing in B-trees. In: Theoretical computer science: 5th GI-conference, pp. 234 - 244. Untitled Event, Karlsruhe, Germany, March 23, 1981. Springer, Berlin, Germany (1981)

Mehlhorn, K.: Pebbling Mountain Ranges and its Application of DCFL-Recognition. In: Automata, languages and programming (ICALP-80): 7th annual international colloquium, pp. 422 - 435. Untitled Event, Noordwijkerhout, The Netherlands, July 14, 1980. Springer, Berlin, Germany (1980)