default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSharath Raghvendra
- > Home > Persons > Sharath Raghvendra
Publications
- 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 - [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
- [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 - [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) - 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) - 2015
- [j1]Pankaj K. Agarwal, R. Sharathkumar:
Streaming Algorithms for Extent Problems in High Dimensions. Algorithmica 72(1): 83-98 (2015) - 2014
- [c9]Pankaj K. Agarwal, R. Sharathkumar:
Approximation algorithms for bipartite matching with metric and geometric costs. STOC 2014: 555-564 - 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
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 00:28 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:
