Follow
Sharath Raghvendra
Sharath Raghvendra
Associate Professor at Virginia Tech
Verified email at vt.edu - Homepage
Title
Cited by
Cited by
Year
Streaming algorithms for extent problems in high dimensions
PK Agarwal, R Sharathkumar
Algorithmica 72 (1), 83-98, 2015
742015
Streaming algorithms for extent problems in high dimensions
PK Agarwal, R Sharathkumar
Algorithmica 72 (1), 83-98, 2015
742015
Approximate Čech complex in low and high dimensions
M Kerber, R Sharathkumar
International Symposium on Algorithms and Computation, 666-676, 2013
482013
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
472014
A robust and optimal online algorithm for minimum metric bipartite matching
S Raghvendra
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
452016
Algorithms for the transportation problem in geometric settings
R Sharathkumar, PK Agarwal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
452012
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
442012
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
382017
Polynomial-sized topological approximations using the permutahedron
A Choudhary, M Kerber, S Raghvendra
Discrete & Computational Geometry 61 (1), 42-80, 2019
272019
Optimal analysis of an online algorithm for the bipartite matching problem on a line
S Raghvendra
arXiv preprint arXiv:1803.07206, 2018
272018
Approximate Euclidean shortest paths amid convex obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
252009
Approximate Euclidean shortest paths amid convex obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
252009
Approximation and streaming algorithms for projective clustering via random projections
M Kerber, S Raghvendra
arXiv preprint arXiv:1407.2063, 2014
222014
A graph theoretic additive approximation of optimal transport
N Lahn, D Mulchandani, S Raghvendra
Advances in Neural Information Processing Systems 32, 2019
212019
Range-aggregate proximity queries
R Sharathkumar, P Gupta
Technical Report IIIT/TR/2007/80, IIIT Hyderabad, 2007
212007
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
142019
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
R Sharathkumar
Proceedings of the twenty-ninth annual symposium on Computational geometry, 9-16, 2013
142013
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
112019
A near-linear time ε-approximation algorithm for geometric bipartite matching
S Raghvendra, PK Agarwal
Journal of the ACM (JACM) 67 (3), 1-19, 2020
92020
Connectivity in random forests and credit networks
A Goel, S Khanna, S Raghvendra, H Zhang
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
92014
The system can't perform the operation now. Try again later.
Articles 1–20