On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
On the detection of a common intersection of k convex objects in the plane
Information Processing Letters
Improved complexity bounds for center location problems on networks by using dynamic data structures
SIAM Journal on Discrete Mathematics
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Journal of Algorithms
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An efficient algorithm for the Euclidean two-center problem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On stabbing lines for convex polyhedra in 3D
Computational Geometry: Theory and Applications
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Information Processing Letters
Rectilinear Static and Dynamic Discrete 2-center Problems
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Two-Center Problems for a Convex Polygon (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximation algorithms for projective clustering
Journal of Algorithms
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
Base station placement on boundary of a convex polygon
Journal of Parallel and Distributed Computing
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Efficient algorithm for placing base stations by avoiding forbidden zone
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |