Sharath Raghvendra

51 papers A* 23A 1B 1Journal 22Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean Metric. SODA Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao
2025	A*	`conf`	Geometric Bipartite Matching Based Exact Algorithms for Server Problems. SoCG Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
2025	J	`jnl`	Geometric Bipartite Matching Based Exact Algorithms for Server Problems. CoRR Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
2025	A*	`conf`	Scalable Approximation Algorithms for p-Wasserstein Distance and Its Variants. ICML Nathaniel Lahn, Sharath Raghvendra, Emma Saarinen, Pouyan Shirzadian
2024	A*	`conf`	A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem. NeurIPS Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao
2024	A*	`conf`	A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions. ICML Sharath Raghvendra, Pouyan Shirzadian, Kaiyi Zhang
2024	J	`jnl`	A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions. CoRR Sharath Raghvendra, Pouyan Shirzadian, Kaiyi Zhang
2024	A*	`conf`	Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. SODA Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao
2023	A*	`conf`	A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings. NeurIPS Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang
2023	A*	`conf`	A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance. ICLR Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
2023	A*	`conf`	A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem. NeurIPS Akshaykumar Gattani, Sharath Raghvendra, Pouyan Shirzadian
2023	A*	`conf`	Computing all Optimal Partial Transports. ICLR Abhijeet Phatak, Sharath Raghvendra, Chittaranjan Tripathy, Kaiyi Zhang
2023	J	`jnl`	Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings. CoRR Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao
2022	J	`jnl`	A Push-Relabel Based Additive Approximation for Optimal Transport. CoRR Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang
2022	—	`conf`	A Scalable Work Function Algorithm for the k-Server Problem. SWAT Sharath Raghvendra, Rachita Sowle
2022	—	`conf`	An Improved ε-Approximation Algorithm for Geometric Bipartite Matching. SWAT Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
2022	J	`jnl`	Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching. CoRR Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao
2022	A*	`conf`	Deterministic, near-linear STOC Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao
2021	A*	`conf`	A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. NeurIPS Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye
2021	A*	`conf`	An SODA Nathaniel Lahn, Sharath Raghvendra
2021	J	`jnl`	Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes. CoRR Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2021	J	`jnl`	Improved approximate rips filtrations with shifted integer lattices and cubical complexes. J. Appl. Comput. Topol. Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2020	J	`jnl`	A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. ACM Trans. Algorithms Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra
2020	J	`jnl`	A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching. J. ACM Sharath Raghvendra, Pankaj K. Agarwal
2020	J	`jnl`	A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings. J. Comput. Geom. Nathaniel Lahn, Sharath Raghvendra
2020	J	`jnl`	An Õ(n CoRR Nathaniel Lahn, Sharath Raghvendra
2019	A*	`conf`	A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. SODA Nathaniel Lahn, Sharath Raghvendra
2019	A*	`conf`	A Graph Theoretic Additive Approximation of Optimal Transport. NeurIPS Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra
2019	J	`jnl`	A Graph Theoretic Additive Approximation of Optimal Transport. CoRR Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra
2019	A*	`conf`	A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. SoCG Nathaniel Lahn, Sharath Raghvendra
2019	J	`jnl`	A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. CoRR Nathaniel Lahn, Sharath Raghvendra
2019	A*	`conf`	Improved Topological Approximations by Digitization. SODA Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2019	J	`jnl`	Polynomial-Sized Topological Approximations Using the Permutahedron. Discret. Comput. Geom. Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2018	J	`jnl`	A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. CoRR Nathaniel Lahn, Sharath Raghvendra
2018	A*	`conf`	A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. SODA Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra
2018	A*	`conf`	A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. SODA Sharath Raghvendra, Mariëtte C. Wessels
2018	J	`jnl`	Improved Topological Approximations by Digitization. CoRR Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2018	A*	`conf`	Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. SoCG Sharath Raghvendra
2018	J	`jnl`	Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. CoRR Sharath Raghvendra
2017	J	`jnl`	A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. CoRR Sharath Raghvendra, Mariëtte C. Wessels
2017	B	`conf`	A k-Median Based Online Algorithm for the Stochastic k-Server Problem. WAOA Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra
2017	A*	`conf`	An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem. FOCS Krati Nayyar, Sharath Raghvendra
2017	A	`conf`	Improved Approximate Rips Filtrations with Shifted Integer Lattices. ESA Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2017	J	`jnl`	Improved Approximate Rips Filtrations with Shifted Integer Lattices. CoRR Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2016	—	`conf`	A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching. APPROX-RANDOM Sharath Raghvendra
2016	J	`jnl`	Polynomial-Sized Topological Approximations Using The Permutahedron. CoRR Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2016	A*	`conf`	Polynomial-Sized Topological Approximations Using the Permutahedron. SoCG Aruni Choudhary, Michael Kerber, Sharath Raghvendra
2015	—	`conf`	Approximation and Streaming Algorithms for Projective Clustering via Random Projections. CCCG Michael Kerber, Sharath Raghvendra
2015	A*	`conf`	Connectivity in Random Forests and Credit Networks. SODA Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang
2014	J	`jnl`	Accurate Streaming Support Vector Machines. CoRR Vikram Nathan, Sharath Raghvendra
2014	J	`jnl`	Approximation and Streaming Algorithms for Projective Clustering via Random Projections. CoRR Michael Kerber, Sharath Raghvendra