Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
SIAM Journal on Computing
Triangulating a polygon in parallel
Journal of Algorithms
An optimal parallel algorithm for building a data structure for planar point location
Journal of Parallel and Distributed Computing
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Randomized parallel algorithms for trapezoidal diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Deterministic Parallel List Ranking
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
An optimal parallel algorithm for detecting weak visibility of a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient Geometric Algorithms on the EREW PRAM
IEEE Transactions on Parallel and Distributed Systems
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
A Dynamic Algorithm for Maintaining Graph Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |