On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Clustering spatial data using random walks
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Reporting intersections among thick objects
Information Processing Letters
Approximation algorithms for the bottleneck stretch factor problem
Nordic Journal of Computing
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Parallel construction of k-nearest neighbor graphs for point clouds
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
An algorithm for discovering clusters of different densities or shapes in noisy data sets
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.01 |