The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
LAMBDA: A quick, low cost layout design system for master-slice LSI s
DAC '82 Proceedings of the 19th Design Automation Conference
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Finding disjoint paths on directed acyclic graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
| Hi-index | 0.00 |