{"id":112,"date":"2021-03-09T13:46:39","date_gmt":"2021-03-09T13:46:39","guid":{"rendered":"https:\/\/wordpress.cs.vt.edu\/algorithms\/?page_id=112"},"modified":"2022-04-13T13:35:42","modified_gmt":"2022-04-13T13:35:42","slug":"grants-publications","status":"publish","type":"page","link":"https:\/\/wordpress.cs.vt.edu\/algorithms\/about\/grants-publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n

Publications<\/strong><\/h2>\n\n\n\n

A Scalable Work Function Algorithm for the k-server Problem
Sharath Raghvendra, Rachita Sowle
SWAT, 2022. <\/p>\n\n\n\n

An Improved \u03b5-Approximation Algorithm for Geometric Bipartite Matching
Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
SWAT, 2022. <\/p>\n\n\n\n

Deterministic, Near-Linear\u00a0\u03b5-Approximation Algorithm for Geometric Bipartite Matching<\/a>
Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao
STOC , 2022.<\/p>\n\n\n\n

A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning<\/a>
Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye
NeurIPS, 2021.<\/p>\n\n\n\n

Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes<\/a>
Aruni Choudhary, Michael Kerber, Sharath Raghvendra
Journal of Applied and Computational Topology, 2021.<\/p>\n\n\n\n

<\/a>An O(n5\/4<\/sup>) Time \u03b5-Approximation Algorithm for RMS Matching in a Plane<\/a>
Nathaniel Lahn, Sharath Raghvendra
SODA 2021.<\/p>\n\n\n\n

A Near-Linear Time \u03b5-Approximation Algorithm for Geometric Bipartite Matching<\/a>
Sharath Raghvendra, Pankaj K. Agarwal.
Journal of the ACM, 2020.<\/p>\n\n\n\n

<\/a>A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs<\/a>
Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra
ACM Transactions on Algorithm, 2020.<\/p>\n\n\n\n

A Graph Theoretic Additive Approximation of Optimal Transport<\/a>
Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra
NeurIPS 2019.<\/p>\n\n\n\n

A Weighted Approach to Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings<\/a>
Nathaniel Lahn, Sharath Raghvendra
SOCG 2019.<\/p>\n\n\n\n

A Faster Algorithm for Minimum-Cost Matching in Minor Free Graphs<\/a>
Nathaniel Lahn, Sharath Raghvendra
SODA 2019.<\/p>\n\n\n\n

Improved Topological Approximations by Digitization<\/a>
Aruni Choudhary, Michael Kerber, Sharath Raghvendra
SODA 2019.<\/p>\n\n\n\n

Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line<\/a>
Sharath Raghvendra
SOCG 2018.<\/p>\n\n\n\n

A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem<\/a>
Sharath Raghvendra, Mariette Wessels
SODA 2018.<\/p>\n\n\n\n

A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs<\/a>
Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra
SODA 2018.<\/p>\n\n\n\n

Improved Approximate Rips Filtration with Shifted Integer Lattices<\/a>
Aruni Choudhary, Michael Kerber, Sharath Raghvendra
ESA 2017.<\/p>\n\n\n\n

An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem<\/a>
Krati Nayyar, Sharath Raghvendra
FOCS 2017.<\/p>\n\n\n\n

A k-Median Based Online Algorithm for the Stochastic k-Server Problem<\/a>
Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra
WAOA 2017.<\/p>\n\n\n\n

Robust and Optimal Online Algorithm for the Minimum Metric Bipartite Matching<\/a>
Sharath Raghvendra
APPROX 2016.<\/p>\n\n\n\n

Polynomial-Sized Topological Approximations Using the Permutahedron<\/a>
Aruni Choudhary, Michael Kerber, Sharath Raghvendra
SOCG 2016.<\/p>\n\n\n\n

Approximation and Streaming Algorithms for Projective Clustering via Random Projections<\/a>
Michael Kerber, Sharath Raghvendra
CCCG 2015.<\/p>\n\n\n\n

Connectivity in Random Forests and Credit Networks<\/a>
Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang
SODA 2015.

Approximation Algorithms for Bipartite Matching with Metric and Geometric Costs<\/a>
Pankaj K. Agarwal, R. Sharathkumar
STOC 2014.

Approximate Cech Complex in Low and High Dimensions<\/a>
Michael Kerber, R. Sharathkumar
ISAAC 2013.

A Sub-Quadratic Algorithm For Bipartite Matching of Planar Points with Bounded Integer Coordinates<\/a>
R. Sharathkumar.
SOCG 2013

A Near-Linear Time \u03b5-Approximation Algorithm for Geometric Bipartite Matching<\/a>
R. Sharathkumar, Pankaj K. Agarwal.
STOC 2012

Algorithms for Transportation Problem in Geometric Settings<\/a>
R. Sharathkumar, Pankaj K. Agarwal.
SODA 2012

Streaming Algorithms for Extent Problems in High Dimensions<\/a>
Pankaj K. Agarwal, R. Sharathkumar
SODA 2010 (Appears in Algorithmica<\/strong>)

Approximate Euclidean Shortest-paths amid Convex Obstacles<\/a>
Pankaj K. Agarwal, R. Sharathkumar, Hai Yu.
SODA 2009

On approximate geodesic-distance queries amid deforming point clouds<\/a>
Pankaj K. Agarwal, Alon Efrat, R. Sharathkumar, Hai Yu.
WAFR 2008

Range Aggregate Proximity Queries<\/a>
R. Sharathkumar, Prosenjit Gupta.
Technical Report, 2007.

Range Aggregate Proximity Detection for Design Rule Checking in VLSI layouts<\/a>
R. Sharathkumar, Prosenjit Gupta.
CCCG, 2006.<\/p>\n","protected":false},"excerpt":{"rendered":"

Publications A Scalable Work Function Algorithm for the k-server ProblemSharath Raghvendra, Rachita SowleSWAT, 2022. An Improved \u03b5-Approximation Algorithm for Geometric Bipartite MatchingPankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita SowleSWAT, 2022. Deterministic, Near-Linear\u00a0\u03b5-Approximation Algorithm for Geometric Bipartite MatchingPankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen XiaoSTOC , 2022. A Faster Maximum Cardinality Matching Algorithm with Applications in … Read more<\/a><\/p>\n","protected":false},"author":301,"featured_media":0,"parent":38,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-112","page","type-page","status-publish"],"_links":{"self":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/112","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/users\/301"}],"replies":[{"embeddable":true,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/comments?post=112"}],"version-history":[{"count":16,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/112\/revisions"}],"predecessor-version":[{"id":276,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/112\/revisions\/276"}],"up":[{"embeddable":true,"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/pages\/38"}],"wp:attachment":[{"href":"https:\/\/wordpress.cs.vt.edu\/algorithms\/wp-json\/wp\/v2\/media?parent=112"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}