Scientific Publications

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)

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)

Lengauer, T.; Mehlhorn, K.: The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts (Sonderforschungsbereich 124, VLSI Entwurfsmethoden und Parallelitaet, 02/1983). Universität des Saarlandes / Fachbereich 10, Saarbrücken (1983), 11 pp.

Mehlhorn, K.: AT²-optimal VLSI for Integer Division and Integer Square Rooting. Universität des Saarlandes, Saarbrücken (1983)

Mehlhorn, K.; Lengauer, T.: VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System. Fachbereich 10 - Angewandte Mathematik und Informatik, Universität des Saarlandes, Saarbrücken (1983)

Lengauer, T.; Mehlhorn, K.: Four results on the complexity of VLSI computations, (1983)

Lengauer, T.; Mehlhorn, K.: VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System, (1983)

Mehlhorn, K.; Preparata, F. P.: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, (1983)

Mehlhorn, K.; Preparata, F. P.: Routing through a Rectangle, (1983)

Mehlhorn, K.; Vishkin, U.: Granularity of parallel memories, (1983)