Approximation algorithms for the bottleneck stretch factor problem
Nordic Journal of Computing
I/O-Efficient Shortest Path Queries in Geometric Spanners
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
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
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
On the dilation spectrum of paths, cycles, and trees
Computational Geometry: Theory and Applications
Geometric algorithms for agglomerative hierarchical clustering
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Journal of Discrete Algorithms
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Geometric minimum spanning trees with GEOFILTERKRUSKAL*
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
| Hi-index | 0.00 |