STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
ACM SIGACT News
The Delaunay tetrahedralization from Delaunay triangulated surfaces
Proceedings of the eighteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum spanning trees in d dimensions
Nordic Journal of Computing
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Smallest Color-Spanning Objects
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Extreme Distances in Multicolored Point Sets
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the symmetric angle-restricted nearest neighbor problem
Information Processing Letters
An approximate algorithm for top-k closest pairs join query in large high dimensional data
Data & Knowledge Engineering
SEDA: a system for search, exploration, discovery, and analysis of XML Data
Proceedings of the VLDB Endowment
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Computational Geometry: Theory and Applications
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms
On the symmetric angle-restricted nearest neighbor problem
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Geometric algorithms for agglomerative hierarchical clustering
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms and theory of computation handbook
Geometric minimum spanning trees with GEOFILTERKRUSKAL*
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Minimizing interference in ad-hoc networks with bounded communication radius
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Minimizing interference in ad hoc networks with bounded communication radius
Information Processing Letters
Spatial query processing for fuzzy objects
The VLDB Journal — The International Journal on Very Large Data Bases
Connected dominating sets on dynamic geometric graphs
Computational Geometry: Theory and Applications
Spanners for geometric intersection graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |