Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Dynamic Planar Convex Hull with Optimal Query Time
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Improved algorithms for several network location problems with equality measures
Discrete Applied Mathematics
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
New results on minimax regret single facility ordered median location problems on networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Weighted rectilinear approximation of points in the plane
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.01 |