Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Dynamic three-dimensional linear programming
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Planar geometric location problems and maintaining the width of a planar set
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete 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
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
A lower bound for randomized algebraic decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
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
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
The 2-center problem with obstacles
Journal of Algorithms
A fast algorithm for the alpha-connected two-center decision problem
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
A local search approximation algorithm for k-means clustering
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
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
Competitive algorithms for maintaining a mobile center
Mobile Networks and Applications
Point set stratification and Delaunay depth
Computational Statistics & Data Analysis
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal location of transportation devices
Computational Geometry: Theory and Applications
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
Efficient approximation algorithms for clustering point-sets
Computational Geometry: Theory and Applications
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
A randomized algorithm for weighted approximation of points by a step function
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Solving the constrained p-center problem using heuristic algorithms
Applied Soft Computing
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms (TALG)
Covering and piercing disks with two centers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Minimum-sum dipolar spanning tree in R3
Computational Geometry: Theory and Applications
Bichromatic 2-center of pairs of points
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Covering and piercing disks with two centers
Computational Geometry: Theory and Applications
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.01 |