Journal of the ACM (JACM) - The MIT Press scientific computation series
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
VLSI layout and packaging of butterfly networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Wiring Knock-Knee Layouts: A Global Approach
IEEE Transactions on Computers
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Note: Edge intersection graphs of systems of paths on a grid with a bounded number of bends
Discrete Applied Mathematics
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On the bend-number of planar and outerplanar graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Edge-intersection graphs of grid paths: The bend-number
Discrete Applied Mathematics
| Hi-index | 14.98 |
The problem of stretching a knock-knee layout in the knock-knee mode to ensure its wirability is considered. An optimal algorithm for the problem in two layers is presented. A 4/3 approximation algorithm for the corresponding problem in three layers, shown to be NP-complete, is devised.