Algorithms for routing and testing routability of planar VLSI layouts
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On continuous Homotopic one layer routing
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Computing Homotopic Shortest Paths Efficiently
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing homotopic shortest paths efficiently
Computational Geometry: Theory and Applications
Thick non-crossing paths and minimum-cost flows in polygonal domains
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Visualization of clustered directed acyclic graphs with node interleaving
Proceedings of the 2009 ACM symposium on Applied Computing
Node overlap removal in clustered directed acyclic graphs
Journal of Visual Languages and Computing
Computing homotopic shortest paths efficiently
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |