A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
Three problems about simple polygons
Computational Geometry: Theory and Applications
Guard placement for efficient point-in-polygon proofs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Engineering planar separator algorithms
Journal of Experimental Algorithmics (JEA)
Three problems about simple polygons
Computational Geometry: Theory and Applications
Probabilistic path queries in road networks: traffic uncertainty aware path selection
Proceedings of the 13th International Conference on Extending Database Technology
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Recursion and parallel algorithms in geometric modeling problems
Cybernetics and Systems Analysis
The system of common algorithmic space to create visual models of phenomena and processes
Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
Theory of Computing Systems
| Hi-index | 0.00 |