Minkowski-type theorems and least-squares partitioning
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
ACM Transactions on Information Systems (TOIS)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGACT News
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Tracking Multiple Moving Objects in Populated, Public Environments
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Extreme Distances in Multicolored Point Sets
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
n-Tokyoites' loop-line commuter problem
Discrete Mathematics
Journal of Experimental Algorithmics (JEA)
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Polygon labelling of minimum leader length
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Boundary Labeling with Octilinear Leaders
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Algorithms and theory of computation handbook
Algorithms for the transportation problem in geometric settings
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Boundary labelling of optimal total leader length
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
A near-linear time ε-approximation algorithm for geometric bipartite matching
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On Clustering to Minimize the Sum of Radii
SIAM Journal on Computing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Connected dominating sets on dynamic geometric graphs
Computational Geometry: Theory and Applications
Bottleneck non-crossing matching in the plane
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The euclidean k-supplier problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
Proceedings of the twenty-ninth annual symposium on Computational geometry
Bottleneck non-crossing matching in the plane
Computational Geometry: Theory and Applications
Reprint of: Optimally solving a transportation problem using Voronoi diagrams
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |