Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fully dynamic geometric spanners
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On bounded leg shortest paths problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry: Theory and Applications
Improved algorithms for fully dynamic geometric spanners and geometric routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Dynamic Spanner for Doubling Metric Spaces
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |