On weighted rectilinear 2-center and 3-center problems
Information Sciences: an International Journal
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Applications of parametric searching in geometric optimization
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
On Some Geometric Selection and Optimization Problems via Sorted Matrices
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear p-piercing problems
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
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
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Information Processing Letters
Rectilinear Static and Dynamic Discrete 2-center Problems
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Combinatorial Linear Programming: Geometry Can Help
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Information Processing Letters
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
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
Algorithms for two-box covering
Proceedings of the twenty-second annual symposium on Computational geometry
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 geometric partitions, covers and K-centers
MCBE'08 Proceedings of the 9th WSEAS International Conference on Mathematics & Computers In Business and Economics
Computing an approximation of the 1-center problem on weighted terrain surfaces
Journal of Experimental Algorithmics (JEA)
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Cache-oblivious selection in sorted X+Y matrices
Information Processing Letters
Square and Rectangle Covering with Outliers
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
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
Covering points by disjoint boxes with outliers
Computational Geometry: Theory and Applications
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms (TALG)
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |