Nathaniel Lahn

15 papers A* 8Journal 7
YearRankTypeTitle / Venue / Authors
2025 A* conf
Scalable Approximation Algorithms for p-Wasserstein Distance and Its Variants.
ICML
Nathaniel Lahn, Sharath Raghvendra, Emma Saarinen, Pouyan Shirzadian
2023 A* conf
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings.
NeurIPS
Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang
2022 J jnl
A Push-Relabel Based Additive Approximation for Optimal Transport.
CoRR
Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang
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
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 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 Õ(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
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