Computing geographic nearest neighbors using monotone matrix searching (preliminary version)
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Selection and sorting in totally monotone arrays
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On computing the optimal bridge between two convex polygons
Information Processing Letters
Computing Farthest Neighbors on a Convex Polytope
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Computing farthest neighbors on a convex polytope
Theoretical Computer Science - Computing and combinatorics
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Base station placement on boundary of a convex polygon
Journal of Parallel and Distributed Computing
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Aggregate farthest-neighbor queries over spatial data
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Efficient algorithm for placing base stations by avoiding forbidden zone
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.89 |