Author:
Recski András,Szeszlér Dávid
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. A. Aggarwal, J. Kleinberg and D. P. Williamson, Node-disjoint paths on the mesh and a new trade-off in VLSI layout, SIAM J. Computing, 29 (2000), 1321–1333.
2. E. Boros, A. Recski and F. Wettl, Unconstrained multilayer switchbox routing, Annals of Operations Research, 58 (1995), 481–491.
3. T. Gallai, His unpublished results were announced in A. Hajnal and J. Surányi, Über die Auflösung von Graphen in vollständige Teilgraphen, Annales Univ. Sci. Budapest Eötvös Sect. Math., 1 (1958), 115–123.
4. S. E. Hambrusch, Channel routing in overlap models, IEEE Trans. Computer-Aided Design of Integrated Circ. Syst., CAD-4 (1985), 23–30.
5. D. S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms, 5 (1984), 147–160.