Journal of the ACM Bibliography
K. Mehlhorn and F. P. Preparata. Routing
through a rectangle. Journal of the ACM, 33(1):60-85,
January 1986.
[BibTeX entry]
Selected papers that cite this one
- Wun-Tat Chan and Francis Y. L. Chin. Efficient algorithms for
finding disjoint paths in grids (extended abstract). In
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete
Algorithms, pages 454-463, New Orleans, Louisiana, 5-7 January
1997.
- Stephan Hartmann, Markus W. Schäffter, and Andreas S. Schulz. Switchbox
routing in VLSI design: Closing the complexity gap.
Theoretical Computer Science, 203(1):31-49, 6 August 1998.
- Michael Kaufmann and Gerhard Klär. Routing in polygons without
rectilinear visible corners. Information and
Computation, 102(2):218-262, February 1993.
- Michael Kaufmann and Kurt Mehlhorn. A linear-time
algorithm for the homotopic routing problem in grid graphs.
SIAM Journal on Computing, 23(2):227-246, April 1994.
- R. Kuchem, D. Wagner, and F. Wagner. Optimizing
area for three-layer knock-knee channel routing.
Algorithmica, 15(5):495-519, May 1996.
Shortcuts: