Sharath Raghvendra
Sharath Raghvendra
Assistant Professor at Virginia Tech
Bestätigte E-Mail-Adresse bei vt.edu - Startseite
TitelZitiert vonJahr
Streaming algorithms for extent problems in high dimensions
PK Agarwal, R Sharathkumar
Algorithmica 72 (1), 83-98, 2015
45*2015
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
292012
Approximate Čech complex in low and high dimensions
M Kerber, R Sharathkumar
International Symposium on Algorithms and Computation, 666-676, 2013
232013
Algorithms for the transportation problem in geometric settings
R Sharathkumar, PK Agarwal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
232012
Approximate Euclidean shortest paths amid convex obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
202009
Approximate Euclidean shortest paths amid convex obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
202009
Range-aggregate proximity queries
R Sharathkumar, P Gupta
Technical Report IIIT/TR/2007/80, IIIT Hyderabad, 2007
182007
A robust and optimal online algorithm for minimum metric bipartite matching
S Raghvendra
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
172016
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
172014
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
132017
Polynomial-sized topological approximations using the permutahedron
A Choudhary, M Kerber, S Raghvendra
Discrete & Computational Geometry, 1-39, 2016
132016
Approximation and streaming algorithms for projective clustering via random projections
M Kerber, S Raghvendra
arXiv preprint arXiv:1407.2063, 2014
122014
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts.
R Sharathkumar, P Gupta
CCCG, 2006
82006
Optimal analysis of an online algorithm for the bipartite matching problem on a line
S Raghvendra
arXiv preprint arXiv:1803.07206, 2018
62018
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
52013
HaiYu. Approximate Euclidean Shortest Paths amid Convex Obstacles
PK Agarwal, R Sharathkumar, H Yu
Proceedings of the nineteenth annual ACM symposium on Theory of computing, Pages, 2009
52009
A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
MK Asathulla, S Khanna, N Lahn, S Raghvendra
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
32018
Efficient external memory segment intersection for processing very large VLSI layouts
R Sharathkumar, MTC Vinaykumar, P Maheshwari, P Gupta
48th Midwest Symposium on Circuits and Systems, 2005., 740-743, 2005
32005
Approximate Cech complexes in low and high dimensions
A Choudhary, M Kerber, R Sharathkumar
Manuscript, 0
3
Improved approximate rips filtrations with shifted integer lattices
A Choudhary, M Kerber, S Raghvendra
arXiv preprint arXiv:1706.07399, 2017
22017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20