Node-disjoint paths on the mesh and a new trade-off in VLSI layout

Authors:
Alok Aggarwal;Jon Kleinberg;David P. Williamson
Affiliations:
I.B.M. T.J. Watson Research Center, P.O. Box 218, Yorktown Heights NY;Laboratory for Computer Science, MIT, Cambridge, MA;I.B.M. T.J. Watson Research Center, P.O. Box 218, Yorktown Heights NY
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

Algorithms for routing and testing routability of planar VLSI layouts

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Graph minors. VII. Disjoint paths on a surface

Journal of Combinatorial Theory Series B
A tight lower bound on the size of planar permutation networks

SIAM Journal on Discrete Mathematics
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Two Steiner tree packing problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Disjoint paths in densely embedded graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The “PI” (placement and interconnect) system

DAC '82 Proceedings of the 19th Design Automation Conference

Hi-index	0.00