| Streaming algorithms for extent problems in high dimensions PK Agarwal, R Sharathkumar Algorithmica 72 (1), 83-98, 2015 | 90* | 2015 |
| A robust and optimal online algorithm for minimum metric bipartite matching S Raghvendra Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 69 | 2016 |
| Approximation algorithms for bipartite matching with metric and geometric costs PK Agarwal, R Sharathkumar Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 68 | 2014 |
| Algorithms for the transportation problem in geometric settings R Sharathkumar, PK Agarwal Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 63 | 2012 |
| Approximate Čech complex in low and high dimensions M Kerber, R Sharathkumar International Symposium on Algorithms and Computation, 666-676, 2013 | 62 | 2013 |
| An input sensitive online algorithm for the metric bipartite matching problem K Nayyar, S Raghvendra 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 59 | 2017 |
| Optimal analysis of an online algorithm for the bipartite matching problem on a line S Raghvendra arXiv preprint arXiv:1803.07206, 2018 | 51 | 2018 |
| A near-linear time ε-approximation algorithm for geometric bipartite matching R Sharathkumar, PK Agarwal Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 49 | 2012 |
| Streaming algorithms for extent problems in high dimensions PK Agarwal, R Sharathkumar Algorithmica 72 (1), 83-98, 2015 | 47 | 2015 |
| A graph theoretic additive approximation of optimal transport N Lahn, D Mulchandani, S Raghvendra Advances in Neural Information Processing Systems 32, 2019 | 41 | 2019 |
| Polynomial-sized topological approximations using the permutahedron A Choudhary, M Kerber, S Raghvendra Discrete & Computational Geometry 61, 42-80, 2019 | 36 | 2019 |
| Approximation and streaming algorithms for projective clustering via random projections M Kerber, S Raghvendra arXiv preprint arXiv:1407.2063, 2014 | 32 | 2014 |
| Approximate Euclidean shortest paths amid convex obstacles PK Agarwal, R Sharathkumar, H Yu Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 29 | 2009 |
| A near-linear time ε-approximation algorithm for geometric bipartite matching S Raghvendra, PK Agarwal Journal of the ACM (JACM) 67 (3), 1-19, 2020 | 23 | 2020 |
| Range-aggregate proximity queries R Sharathkumar, P Gupta Technical Report IIIT/TR/2007/80, IIIT Hyderabad, 2007 | 22 | 2007 |
| Improved approximate rips filtrations with shifted integer lattices and cubical complexes A Choudhary, M Kerber, S Raghvendra Journal of Applied and Computational Topology 5 (3), 425-458, 2021 | 20* | 2021 |
| Deterministic, near-linear 𝜀-approximation algorithm for geometric bipartite matching PK Agarwal, HC Chang, S Raghvendra, A Xiao Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 18 | 2022 |
| A faster algorithm for minimum-cost bipartite perfect matching in planar graphs MK Asathulla, S Khanna, N Lahn, S Raghvendra ACM Transactions on Algorithms (TALG) 16 (1), 1-30, 2019 | 18 | 2019 |
| Computing all optimal partial transports A Phatak, S Raghvendra, C Tripathy, K Zhang International Conference on Learning Representations, 2023 | 17 | 2023 |
| A faster algorithm for minimum-cost bipartite matching in minor-free graphs N Lahn, S Raghvendra Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 17 | 2019 |
Pankaj K. AgarwalDuke UniversityVerified email at cs.duke.edu
