Acm Transactions on Algorithms
-
Publication Venue For
- An efficient algorithm for computing high-quality paths amid polygonal obstacles. 14. 2018
- Nearest-neighbor searching under uncertainty II. 13. 2016
- On hierarchical routing in doubling metrics. 12. 2016
- Range searching on uncertain data. 8. 2012
- Adaptive uncertainty resolution in bayesian combinatorial optimization problems. 8. 2012
- How to probe for an extreme value. 7. 2010
- I/O-efficient batched union-find and its applications to terrain analysis. 7. 2010
- Hausdorff distance under translation for points and balls. 6. 2010
- An optimal decomposition algorithm for tree edit distance. 6. 2009
- Simultaneous source location. 6. 2009
- Algorithms for center and Tverberg points. 5. 2008
- Kinetic and dynamic data structures for closest pair and all nearest neighbors. 5. 2008
- Efficient algorithms for bichromatic separability. 2:209-227. 2006
- Editorial 2017
- Online Service with Delay. 17. 2021
- Computing the gromov-hausdorff distance for metric trees 2018