default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSharath Raghvendra
Person information
- affiliation: Virginia Polytechnic Institute and State University, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2012
[b1]Sharathkumar Raghvendra:
Geometric Approximation Algorithms - A Summary Based Approach. Duke University, Durham, NC, USA, 2012
Journal Articles
- 2021
- [j6]Aruni Choudhary
, Michael Kerber, Sharath Raghvendra:
Improved approximate rips filtrations with shifted integer lattices and cubical complexes. J. Appl. Comput. Topol. 5(3): 425-458 (2021) - 2020
- [j5]Sharath Raghvendra, Pankaj K. Agarwal:
A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching. J. ACM 67(3): 18:1-18:19 (2020) - [j4]Nathaniel Lahn, Sharath Raghvendra:
A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings. J. Comput. Geom. 11(2): 183-204 (2020) - [j3]Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. ACM Trans. Algorithms 16(1): 2:1-2:30 (2020) - 2019
- [j2]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using the Permutahedron. Discret. Comput. Geom. 61(1): 42-80 (2019) - 2015
- [j1]Pankaj K. Agarwal, R. Sharathkumar:
Streaming Algorithms for Extent Problems in High Dimensions. Algorithmica 72(1): 83-98 (2015)
Conference and Workshop Papers
- 2024
- [c34]Sharath Raghvendra, Pouyan Shirzadian, Kaiyi Zhang:
A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions. ICML 2024 - [c33]Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao:
Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. SODA 2024: 4514-4529 - 2023
- [c32]Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle:
A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance. ICLR 2023 - [c31]Abhijeet Phatak, Sharath Raghvendra, Chittaranjan Tripathy, Kaiyi Zhang:
Computing all Optimal Partial Transports. ICLR 2023 - [c30]Akshaykumar Gattani, Sharath Raghvendra, Pouyan Shirzadian:
A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem. NeurIPS 2023 - [c29]Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang:
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings. NeurIPS 2023 - 2022
- [c28]Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao:
Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching. STOC 2022: 1052-1065 - [c27]Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle:
An Improved ε-Approximation Algorithm for Geometric Bipartite Matching. SWAT 2022: 6:1-6:20 - [c26]Sharath Raghvendra, Rachita Sowle:
A Scalable Work Function Algorithm for the k-Server Problem. SWAT 2022: 30:1-30:20 - 2021
- [c25]Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye:
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. NeurIPS 2021: 16885-16898 - [c24]Nathaniel Lahn, Sharath Raghvendra:
An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane. SODA 2021: 869-888 - 2019
- [c23]Nathaniel Lahn, Sharath Raghvendra:
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. SoCG 2019: 48:1-48:13 - [c22]Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra:
A Graph Theoretic Additive Approximation of Optimal Transport. NeurIPS 2019: 13813-13823 - [c21]Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. SODA 2019: 569-588 - [c20]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Topological Approximations by Digitization. SODA 2019: 2675-2688 - 2018
- [c19]Sharath Raghvendra:
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. SoCG 2018: 67:1-67:14 - [c18]Sharath Raghvendra, Mariëtte C. Wessels:
A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. SODA 2018: 101-120 - [c17]Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. SODA 2018: 457-476 - 2017
- [c16]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices. ESA 2017: 28:1-28:13 - [c15]Krati Nayyar, Sharath Raghvendra:
An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem. FOCS 2017: 505-515 - [c14]Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra:
A k-Median Based Online Algorithm for the Stochastic k-Server Problem. WAOA 2017: 176-189 - 2016
- [c13]Sharath Raghvendra:
A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching. APPROX-RANDOM 2016: 18:1-18:16 - [c12]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using the Permutahedron. SoCG 2016: 31:1-31:16 - 2015
- [c11]Michael Kerber, Sharath Raghvendra:
Approximation and Streaming Algorithms for Projective Clustering via Random Projections. CCCG 2015 - [c10]Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang:
Connectivity in Random Forests and Credit Networks. SODA 2015: 2037-2048 - 2014
- [c9]Pankaj K. Agarwal, R. Sharathkumar:
Approximation algorithms for bipartite matching with metric and geometric costs. STOC 2014: 555-564 - 2013
- [c8]R. Sharathkumar:
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates. SoCG 2013: 9-16 - [c7]Michael Kerber, R. Sharathkumar:
Approximate Čech Complex in Low and High Dimensions. ISAAC 2013: 666-676 - 2012
- [c6]R. Sharathkumar, Pankaj K. Agarwal:
Algorithms for the transportation problem in geometric settings. SODA 2012: 306-317 - [c5]R. Sharathkumar, Pankaj K. Agarwal:
A near-linear time ε-approximation algorithm for geometric bipartite matching. STOC 2012: 385-394 - 2010
- [c4]Pankaj K. Agarwal, R. Sharathkumar:
Streaming Algorithms for Extent Problems in High Dimensions. SODA 2010: 1481-1489 - 2009
- [c3]Pankaj K. Agarwal, R. Sharathkumar, Hai Yu:
Approximate Euclidean shortest paths amid convex obstacles. SODA 2009: 283-292 - 2008
- [c2]Pankaj K. Agarwal, Alon Efrat, R. Sharathkumar, Hai Yu:
On Approximate Geodesic-Distance Queries amid Deforming Point Clouds. WAFR 2008: 351-365 - 2006
- [c1]R. Sharathkumar, Prosenjit Gupta:
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. CCCG 2006
Informal and Other Publications
- 2024
- [i17]Sharath Raghvendra, Pouyan Shirzadian, Kaiyi Zhang:
A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions. CoRR abs/2405.03664 (2024) - 2023
- [i16]Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao:
Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. CoRR abs/2311.02172 (2023) - 2022
- [i15]Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang:
A Push-Relabel Based Additive Approximation for Optimal Transport. CoRR abs/2203.03732 (2022) - [i14]Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao:
Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching. CoRR abs/2204.03875 (2022) - 2021
- [i13]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes. CoRR abs/2105.05151 (2021) - 2020
- [i12]Nathaniel Lahn, Sharath Raghvendra:
An Õ(n5/4) Time ε-Approximation Algorithm for RMS Matching in a Plane. CoRR abs/2007.07720 (2020) - 2019
- [i11]Nathaniel Lahn, Sharath Raghvendra:
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. CoRR abs/1903.10445 (2019) - [i10]Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra:
A Graph Theoretic Additive Approximation of Optimal Transport. CoRR abs/1905.11830 (2019) - 2018
- [i9]Sharath Raghvendra:
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. CoRR abs/1803.07206 (2018) - [i8]Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. CoRR abs/1807.04802 (2018) - [i7]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Topological Approximations by Digitization. CoRR abs/1812.04966 (2018) - 2017
- [i6]Sharath Raghvendra, Mariëtte C. Wessels:
A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. CoRR abs/1706.03263 (2017) - [i5]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices. CoRR abs/1706.07399 (2017) - 2016
- [i4]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using The Permutahedron. CoRR abs/1601.02732 (2016) - 2014
- [i3]Michael Kerber, Sharath Raghvendra:
Approximation and Streaming Algorithms for Projective Clustering via Random Projections. CoRR abs/1407.2063 (2014) - [i2]Vikram Nathan, Sharath Raghvendra:
Accurate Streaming Support Vector Machines. CoRR abs/1412.2485 (2014) - 2013
- [i1]Michael Kerber, R. Sharathkumar:
Approximate Cech Complexes in Low and High Dimensions. CoRR abs/1307.3272 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
