Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Geometric applications of a matrix searching algorithm
SCG '86 Proceedings of the second annual symposium on Computational geometry
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
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
On maximum flows in polyhedral domains
Journal of Computer and System Sciences
On solving geometric optimization problems using shortest paths
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Single-layer wire routing and compaction
Single-layer wire routing and compaction
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Rectilinear paths among rectilinear obstacles
Discrete Applied Mathematics
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
Proceedings of the eighteenth annual symposium on Computational geometry
Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Computing Homotopic Shortest Paths Efficiently
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Length-bounded disjoint paths in planar graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
General river routing algorithm
DAC '83 Proceedings of the 20th Design Automation Conference
Computing homotopic shortest paths in the plane
Journal of Algorithms
Thick non-crossing paths and minimum-cost continuous flows in polygonal domains
Thick non-crossing paths and minimum-cost continuous flows in polygonal domains
Maximum thick paths in static and dynamic environments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Maximum thick paths in static and dynamic environments
Computational Geometry: Theory and Applications
Routing multi-class traffic flows in the plane
Computational Geometry: Theory and Applications
Homotopic rectilinear routing with few links and thick edges
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Shortest non-crossing walks in the plane
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Sweeping a terrain by collaborative aerial vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.01 |