Congestion-Approximators from the Bottom Up.
Jason Li, Satish Rao, Di Wang.
SODA 2025. (arXiv) Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.
Monika Henzinger, Jason Li, Satish Rao, Di Wang.
SODA 2024. (arXiv) Best Paper
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time.
Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak.
FOCS 2023. Undirected (1+ɛ)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms.
Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li (r).
STOC 2022. (arXiv) Approximate Gomory-Hu Tree Is Faster than n-1 Maxflows.
Jason Li, Debmalya Panigrahi.
STOC 2021. (arXiv) Vertex Connectivity in Poly-logarithmic Max-flows.
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai.
STOC 2021. (arXiv) A Quasipolynomial (2+ɛ)-Approximation for Planar Sparsest Cut.
Vincent Cohen-Addad, Anupam Gupta, Philip N Klein, Jason Li.
STOC 2021. (arXiv) Deterministic Min-cut in Poly-logarithmic Max-flows.
Jason Li, Debmalya Panigrahi.
FOCS 2020. (arXiv) A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond.
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak.
FOCS 2020. (arXiv) The Karger-Stein Algorithm is Optimal for k-cut.
Anupam Gupta, David Harris, Euiwoong Lee, Jason Li.
STOC 2020. (arXiv)
Congestion-Approximators from the Bottom Up.
Jason Li, Satish Rao, Di Wang.
SODA 2025. (arXiv) Unbreakable Decomposition in Close-to-Linear Time.
Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak.
SODA 2025. (arXiv) Fully Dynamic Minimum Cut in Subpolynomial Time per Operation.
Antoine El-Hayek, Monika Henzinger, Jason Li.
SODA 2025. Deterministic Minimum Steiner Cut in Maximum Flow Time.
Matthew Ding, Jason Li.
ESA 2024. (arXiv) Hypergraph Unreliability in Quasi-Polynomial Time.
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
STOC 2024. (arXiv) Approximating Small Sparse Cuts.
Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak.
STOC 2024. (arXiv) Low-Step Multi-Commodity Flow Emulators.
Bernhard Haeupler, D Ellis Hershkowitz, Jason Li, Antti Röyskö, Thatchaphol Saranurak.
STOC 2024. (arXiv) Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.
Monika Henzinger, Jason Li, Satish Rao, Di Wang.
SODA 2024. (arXiv) Best Paper
Beyond the Quadratic Time Barrier for Network Unreliability.
Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi.
SODA 2024. (arXiv) All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time.
Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak.
FOCS 2023. Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows.
Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi.
SODA 2023. (arXiv) Near-Linear Time Approximations for Cut Problems via Fair Cuts.
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak.
SODA 2023. (arXiv) A Local Search-Based Approach for Set Covering.
Anupam Gupta, Jason Li, Euiwoong Lee.
SOSA 2023. (arXiv) Gomory-Hu Tree in Subcubic Time.
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi.
FOCS 2022. (arXiv) O(1) Steiner Point Removal in Series-Parallel Graphs.
D Ellis Hershkowitz, Jason Li.
ESA 2022. (arXiv) Matroid-Based TSP Rounding for Half-Integral Solutions.
Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar.
IPCO 2022. (arXiv) Undirected (1+ɛ)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms.
Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li (r).
STOC 2022. (arXiv) Breaking the n^k Barrier for Minimum k-cut on Simple Graphs.
Zhiyang He, Jason Li.
STOC 2022. (arXiv) Edge Connectivity Augmentation in Near-Linear Time.
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
STOC 2022. (arXiv) Augmenting Edge Connectivity via Isolating Cuts.
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
SODA 2022. (arXiv) Minimum Cuts in Directed Graphs via Partial Sparsification.
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak.
FOCS 2021. (arXiv) A Nearly Optimal All Pairs Minimum Cuts Algorithm in Simple Graphs.
Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak.
FOCS 2021. (arXiv) Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs.
Zhiyang He, Jason Li, Magnus Wahlström.
ESA 2021. (arXiv) Best Paper
Approximate Gomory-Hu Tree Is Faster than n-1 Maxflows.
Jason Li, Debmalya Panigrahi.
STOC 2021. (arXiv) Deterministic Mincut in Almost-Linear Time.
Jason Li.
STOC 2021. (arXiv) Vertex Connectivity in Poly-logarithmic Max-flows.
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai.
STOC 2021. (arXiv) A Quasipolynomial (2+ɛ)-Approximation for Planar Sparsest Cut.
Vincent Cohen-Addad, Anupam Gupta, Philip N Klein, Jason Li.
STOC 2021. (arXiv) The Connectivity Threshold for Dense Graphs.
Anupam Gupta, Euiwoong Lee, Jason Li.
SODA 2021. Deterministic Min-cut in Poly-logarithmic Max-flows.
Jason Li, Debmalya Panigrahi.
FOCS 2020. (arXiv) A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond.
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak.
FOCS 2020. (arXiv) The Karger-Stein Algorithm is Optimal for k-cut.
Anupam Gupta, David Harris, Euiwoong Lee, Jason Li.
STOC 2020. (arXiv) Faster Parallel Algorithm for Approximate Shortest Path.
Jason Li.
STOC 2020. (arXiv) Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time.
Jason Li, Jesper Nederlof.
SODA 2020. (arXiv) Faster Minimum k-cut of a Simple Graph.
Jason Li.
FOCS 2019. (arXiv) Machtey Best Student Paper
On the Fixed-Parameter Tractability of Capacitated Clustering.
Vincent Cohen-Addad, Jason Li.
ICALP 2019. Tight FPT Approximations for k-Median and k-Means.
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li.
ICALP 2019. (arXiv) Distributed Computation in the Node-Congested Clique.
John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, Christian Scheideler.
SPAA 2019. (arXiv) The Number of Minimum k-Cuts: Improving the Karger-Stein Bound.
Anupam Gupta, Euiwoong Lee, Jason Li.
STOC 2019. (arXiv) Planar Diameter via Metric Compression.
Jason Li, Merav Parter.
STOC 2019. (arXiv) Losing Treewidth by Separating Subsets.
Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk.
SODA 2019. (arXiv) Faster Exact and Approximate Algorithms for k-Cut.
Anupam Gupta, Euiwoong Lee, Jason Li.
FOCS 2018. (arXiv) New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms.
Mohsen Ghaffari, Jason Li.
DISC 2018. (arXiv) Faster Distributed Shortest Path Approximations via Shortcuts.
Bernhard Haeupler, Jason Li.
DISC 2018. (arXiv) Minor Excluded Network Families Admit Fast Distributed Algorithms.
Bernhard Haeupler, Jason Li, Goran Zuzic.
PODC 2018. (arXiv) Non-Preemptive Flow-Time Minimization via Rejections.
Anupam Gupta, Amit Kumar, Jason Li.
ICALP 2018. (arXiv) Improved Distributed Algorithms for Exact Shortest Paths.
Mohsen Ghaffari, Jason Li.
STOC 2018. (arXiv) An FPT Algorithm Beating 2-Approximation for k-Cut.
Anupam Gupta, Euiwoong Lee, Jason Li.
SODA 2018. (arXiv)