The complexity of robot motion planning
The complexity of robot motion planning
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Algorithmic motion planning in robotics
Handbook of theoretical computer science (vol. A)
Approximate Euclidean shortest path in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Counting connected components of a semialgebraic set in subexponential time
Computational Complexity
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Robot Motion Planning
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane
AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing homotopic shortest paths in the plane
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
Invariants for homology classes with application to optimal search and planning problem in robotics
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |