Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. - R. Sharathkumar; Prosenjit Gupta (CCCG, 2006)

On Approximate Geodesic-Distance Queries amid Deforming Point Clouds. - Pankaj K. Agarwal; Alon Efrat; R. Sharathkumar; Hai Yu 005 (WAFR, 2008)

Approximate Euclidean shortest paths amid convex obstacles. - Pankaj K. Agarwal; R. Sharathkumar; Hai Yu 005 (SODA, 2009)

Algorithms for the transportation problem in geometric settings. - R. Sharathkumar; Pankaj K. Agarwal (SODA, 2012)

Geometric Approximation Algorithms - A Summary Based Approach. - Sharathkumar Raghvendra (2012)

A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates. - R. Sharathkumar (SoCG, 2013)

Approximate Čech Complex in Low and High Dimensions. - Michael Kerber; R. Sharathkumar (ISAAC, 2013)

Approximate Cech Complexes in Low and High Dimensions. - Michael Kerber; R. Sharathkumar (CoRR, 2013)

Approximation algorithms for bipartite matching with metric and geometric costs. - Pankaj K. Agarwal; R. Sharathkumar (STOC, 2014)

Accurate Streaming Support Vector Machines. - Vikram Nathan; Sharath Raghvendra (CoRR, 2014)

Approximation and Streaming Algorithms for Projective Clustering via Random Projections. - Michael Kerber; Sharath Raghvendra (CCCG, 2015)

Connectivity in Random Forests and Credit Networks. - Ashish Goel; Sanjeev Khanna; Sharath Raghvendra; Hongyang Zhang 005 (SODA, 2015)

Streaming Algorithms for Extent Problems in High Dimensions. - Pankaj K. Agarwal; R. Sharathkumar (Algorithmica, 2015)

A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching. - Sharath Raghvendra (APPROX-RANDOM, 2016)

Improved Approximate Rips Filtrations with Shifted Integer Lattices. - Aruni Choudhary; Michael Kerber; Sharath Raghvendra (ESA, 2017)

An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem. - Krati Nayyar; Sharath Raghvendra (FOCS, 2017)

A k-Median Based Online Algorithm for the Stochastic k-Server Problem. - Abhijin Adiga; Alexander D. Friedman; Sharath Raghvendra (WAOA, 2017)

Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. - Sharath Raghvendra (SoCG, 2018)

A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. - Sharath Raghvendra; Mariëtte C. Wessels (SODA, 2018)

A Graph Theoretic Additive Approximation of Optimal Transport. - Nathaniel Lahn; Deepika Mulchandani; Sharath Raghvendra (NeurIPS, 2019)

Improved Topological Approximations by Digitization. - Aruni Choudhary; Michael Kerber; Sharath Raghvendra (SODA, 2019)

A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. - Nathaniel Lahn; Sharath Raghvendra (SODA, 2019)

Polynomial-Sized Topological Approximations Using the Permutahedron. - Aruni Choudhary; Michael Kerber; Sharath Raghvendra (Discret. Comput. Geom., 2019)

An Õ(n5/4) Time ε-Approximation Algorithm for RMS Matching in a Plane. - Nathaniel Lahn; Sharath Raghvendra (CoRR, 2020)

A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching. - Sharath Raghvendra; Pankaj K. Agarwal (J. ACM, 2020)

A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings. - Nathaniel Lahn; Sharath Raghvendra (J. Comput. Geom., 2020)

A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. - Mudabir Kabir Asathulla; Sanjeev Khanna; Nathaniel Lahn; Sharath Raghvendra (ACM Trans. Algorithms, 2020)

A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. - Nathaniel Lahn; Sharath Raghvendra; Jiacheng Ye (NeurIPS, 2021)

An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane. - Nathaniel Lahn; Sharath Raghvendra (SODA, 2021)

Improved approximate rips filtrations with shifted integer lattices and cubical complexes. - Aruni Choudhary; Michael Kerber; Sharath Raghvendra (J. Appl. Comput. Topol., 2021)

Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching. - Pankaj K. Agarwal; Hsien-Chih Chang; Sharath Raghvendra; Allen Xiao (STOC, 2022)

An Improved ε-Approximation Algorithm for Geometric Bipartite Matching. - Pankaj K. Agarwal; Sharath Raghvendra; Pouyan Shirzadian; Rachita Sowle (SWAT, 2022)

A Scalable Work Function Algorithm for the k-Server Problem. - Sharath Raghvendra; Rachita Sowle (SWAT, 2022)

A Push-Relabel Based Additive Approximation for Optimal Transport. - Nathaniel Lahn; Sharath Raghvendra; Kaiyi Zhang 004 (CoRR, 2022)

Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching. - Pankaj K. Agarwal; Hsien-Chih Chang; Sharath Raghvendra; Allen Xiao (CoRR, 2022)

A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance. - Pankaj K. Agarwal; Sharath Raghvendra; Pouyan Shirzadian; Rachita Sowle (ICLR, 2023)

Computing all Optimal Partial Transports. - Abhijeet Phatak; Sharath Raghvendra; Chittaranjan Tripathy; Kaiyi Zhang 004 (ICLR, 2023)

A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem. - Akshaykumar Gattani; Sharath Raghvendra; Pouyan Shirzadian (NeurIPS, 2023)

A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings. - Nathaniel Lahn; Sharath Raghvendra; Kaiyi Zhang 004 (NeurIPS, 2023)

A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions. - Sharath Raghvendra; Pouyan Shirzadian; Kaiyi Zhang 004 (ICML, 2024)

A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem. - Pankaj K. Agarwal; Sharath Raghvendra; Pouyan Shirzadian; Keegan Yao (NeurIPS, 2024)

Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. - Pankaj K. Agarwal; Sharath Raghvendra; Pouyan Shirzadian; Keegan Yao (SODA, 2024)

Geometric Bipartite Matching Based Exact Algorithms for Server Problems. - Sharath Raghvendra; Pouyan Shirzadian; Rachita Sowle (SoCG, 2025)

Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean Metric. - Pankaj K. Agarwal; Sharath Raghvendra; Pouyan Shirzadian; Keegan Yao (SODA, 2025)