On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
The 2-center problem with obstacles
Journal of Algorithms
A fast algorithm for the alpha-connected two-center decision problem
Information Processing Letters
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Base station placement on boundary of a convex polygon
Journal of Parallel and Distributed Computing
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
New Algorithms for k-Center and Extensions
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms (TALG)
Efficient algorithm for placing base stations by avoiding forbidden zone
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Covering and piercing disks with two centers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Covering and piercing disks with two centers
Computational Geometry: Theory and Applications
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry
Streaming with minimum space: An algorithm for covering by two congruent balls
Theoretical Computer Science
| Hi-index | 0.00 |