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

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

An Õ(n5/4) Time ε-Approximation Algorithm for RMS Matching in a Plane. - Nathaniel Lahn; Sharath Raghvendra (CoRR, 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)

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

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