A direct linear-time planarity test for unflippable modules

References

• Dolev , Dan , Karplus , Kevin , Siegel , Alan , Alex , . and Ullman , Jeffrey D. 1981 . Optimal Wiring Between Rectangles , 312 – 317 . Milwaukee . 13th STOC
   Google Scholar
• Hopecroft , John and Tarjan , Robert . 1974 . Efficient planarity testing . Journal ACM , 21 ( 4 ) : 549 – 568 .
   Web of Science ®Google Scholar
• Even , Simon and Tarjan , Robert . 1976 . Computing an s–i numbering . Theoretical Computer Science , 2 ( 4 ) : 339 – 344 .
   Google Scholar
• Kramer , Mark R. and Leeuwen , Jan van. February 1982 . Wire-routing is NP-complete , February , Utrecht University . Information Group technical paper RUU-CS-82-4
   Google Scholar
• Leiserson , Charles E. and Pinter , Ron Y. 1983 . Optimal placement for river routing . SIAM Journal of Computing , 12 ( 3 ) February : 447 – 462 .
   Web of Science ®Google Scholar
• Lempel , A. , Even , S. and Cederbaum , I. . An algorithm for planarity testing of graphs . Theory of Graphs, International Symposium . July 1966 , Rome. Edited by: Rosensthiel , P. pp. 215 – 232 . New York : Gordon and Breach .
   Google Scholar
• Pinter , Ron Y. August 1982 . The impact of layer assignment methods on layout algorithms for integrated circuits August , Ph.D. thesis. MIT Department of EECS
   Google Scholar