A multi-pass, multi-algorithm approach to PCB routing
DAC '78 Proceedings of the 15th Design Automation Conference
PRO - an automatic string placement program for polycell layout
DAC '76 Proceedings of the 13th Design Automation Conference
DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
25 years of DAC Papers on Twenty-five years of electronic design automation
The channeled-BSG: a universal floorplan for simultaneous place/route with IC applications
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Manhattan channel routing with good theoretical and practical performance
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient placement and routing techniques for master slice LSI
DAC '80 Proceedings of the 17th Design Automation Conference
An approximation algorithm for manhattan routing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A consideration of the number of horizontal grids used in the routing of a masterslice layout
DAC '82 Proceedings of the 19th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
On routing two-point nets across a channel
DAC '82 Proceedings of the 19th Design Automation Conference
Optimal Wiring of Movable Terminals
IEEE Transactions on Computers
Dawn of computer-aided design: from graph-theory to place and route
Proceedings of the 2013 ACM international symposium on International symposium on physical design
Coding the objects in place and route CAD
Proceedings of the 2013 ACM international symposium on International symposium on physical design
| Hi-index | 0.00 |
This paper presents a new routing principle that leads to an algorithm to realize the minimum width of the 2-layer channel area between two rows of terminals to be interconnected. Besides the theoretical results, practically applicable routing algorithms based on our principle are developed.