Nathaniel Lahn

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 14

Top Topics

Maximum Cardinality

Bipartite Matching

Network Flow Problem

Top Venues

J. Comput. Geom.

Publications

Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings. NeurIPS (2023)
Nathaniel Lahn, Sharath Raghvendra, Kaiyi Zhang
A Push-Relabel Based Additive Approximation for Optimal Transport. CoRR (2022)
Nathaniel Lahn, Sharath Raghvendra
-Approximation Algorithm for RMS Matching in a Plane. SODA (2021)
Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. NeurIPS (2021)
Nathaniel Lahn, Sharath Raghvendra
) Time ε-Approximation Algorithm for RMS Matching in a Plane. CoRR (2020)
Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. ACM Trans. Algorithms 16 (1) (2020)
Nathaniel Lahn, Sharath Raghvendra
A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings. J. Comput. Geom. 11 (2) (2020)
Nathaniel Lahn, Sharath Raghvendra
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. SoCG (2019)
Nathaniel Lahn, Sharath Raghvendra
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. SODA (2019)
Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra
A Graph Theoretic Additive Approximation of Optimal Transport. NeurIPS (2019)
Nathaniel Lahn, Deepika Mulchandani, Sharath Raghvendra
A Graph Theoretic Additive Approximation of Optimal Transport. CoRR (2019)
Nathaniel Lahn, Sharath Raghvendra
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. CoRR (2019)
Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra
A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. SODA (2018)
Nathaniel Lahn, Sharath Raghvendra
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. CoRR (2018)