1. M. Becker and K. Mehlhorn, Routing and edge-disjoint paths in planar graph, Acta Informatica, to appear.
2. VLSI Routing: Four Layers Suffice;Brady,1984
3. Disjoint paths in rectilinear grids;Frank;Combinatorica,1982
4. Wire Routing is NP-Complete;Kramer;Technical Report RUU-CS-82-4,1982
5. Routing through a rectangle;Mehlhorn;JACM,1986