Bounding laconic proof systems by solving CSPs in parallel. - Jason Li 006; Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2016)

An FPT Algorithm Beating 2-Approximation for k-Cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (CoRR, 2017)

Faster Exact and Approximate Algorithms for k-Cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (FOCS, 2018)

Non-Preemptive Flow-Time Minimization via Rejections. - Anupam Gupta 001; Amit Kumar 001; Jason Li 006 (ICALP, 2018)

Minor Excluded Network Families Admit Fast Distributed Algorithms. - Bernhard Haeupler; Jason Li 006; Goran Zuzic (PODC, 2018)

An FPT Algorithm Beating 2-Approximation for k-Cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (SODA, 2018)

Improved distributed algorithms for exact shortest paths. - Mohsen Ghaffari 001; Jason Li 006 (STOC, 2018)

New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. - Mohsen Ghaffari 001; Jason Li 006 (DISC, 2018)

Faster Distributed Shortest Path Approximations via Shortcuts. - Bernhard Haeupler; Jason Li 006 (DISC, 2018)

Distributed Computation in the Node-Congested Clique. - John Augustine; Mohsen Ghaffari 001; Robert Gmyr; Kristian Hinnenthal; Fabian Kuhn; Jason Li 006; Christian Scheideler (CoRR, 2018)

Distributed Treewidth Computation. - Jason Li 006 (CoRR, 2018)

Faster Minimum k-cut of a Simple Graph. - Jason Li 006 (FOCS, 2019)

Tight FPT Approximations for k-Median and k-Means. - Vincent Cohen-Addad; Anupam Gupta 001; Amit Kumar 001; Euiwoong Lee; Jason Li 006 (ICALP, 2019)

On the Fixed-Parameter Tractability of Capacitated Clustering. - Vincent Cohen-Addad; Jason Li 006 (ICALP, 2019)

Losing Treewidth by Separating Subsets. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006; Pasin Manurangsi; Michal Wlodarczyk 001 (SODA, 2019)

Distributed Computation in Node-Capacitated Networks. - John Augustine; Mohsen Ghaffari 001; Robert Gmyr; Kristian Hinnenthal; Christian Scheideler; Fabian Kuhn; Jason Li 006 (SPAA, 2019)

The number of minimum k-cuts: improving the Karger-Stein bound. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (STOC, 2019)

Planar diameter via metric compression. - Jason Li 006; Merav Parter (STOC, 2019)

The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (CoRR, 2019)

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. - Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (CoRR, 2019)

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. - Julia Chuzhoy; Yu Gao 001; Jason Li 006; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

Deterministic Min-cut in Poly-logarithmic Max-flows. - Jason Li 006; Debmalya Panigrahi (FOCS, 2020)

Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time. - Jason Li 006; Jesper Nederlof (SODA, 2020)

The Karger-Stein algorithm is optimal for k-cut. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (STOC, 2020)

Faster parallel algorithm for approximate shortest path. - Jason Li 006 (STOC, 2020)

Optimal Bounds for the k-cut Problem. - Anupam Gupta 001; David G. Harris 001; Euiwoong Lee; Jason Li 006 (CoRR, 2020)

Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs. - Zhiyang He; Jason Li 006 (CoRR, 2020)

Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. - Zhiyang He; Jason Li 006; Magnus Wahlström (ESA, 2021)

A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. - Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak (FOCS, 2021)

Minimum Cuts in Directed Graphs via Partial Sparsification. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Kent Quanrud (FOCS, 2021)

The Connectivity Threshold for Dense Graphs. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (SODA, 2021)

A quasipolynomial (2 + ε)-approximation for planar sparsest cut. - Vincent Cohen-Addad; Anupam Gupta 001; Philip N. Klein; Jason Li 006 (STOC, 2021)

Deterministic mincut in almost-linear time. - Jason Li 006 (STOC, 2021)

Vertex connectivity in poly-logarithmic max-flows. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (STOC, 2021)

Approximate Gomory-Hu tree is faster than n - 1 max-flows. - Jason Li 006; Debmalya Panigrahi (STOC, 2021)

Minimum Cuts in Directed Graphs via √n Max-Flows. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (CoRR, 2021)

A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut. - Vincent Cohen-Addad; Anupam Gupta 001; Philip N. Klein; Jason Li 006 (CoRR, 2021)

Deterministic Weighted Expander Decomposition in Almost-linear Time. - Jason Li 006; Thatchaphol Saranurak (CoRR, 2021)

Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows. - Jason Li 006; Debmalya Panigrahi (CoRR, 2021)

Breaking the nk Barrier for Minimum $k$-cut on Simple Graphs. - Zhiyang He; Jason Li 006 (CoRR, 2021)

Gomory-Hu Tree in Subcubic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (CoRR, 2021)

Preconditioning and Locality in Algorithm Design. - Jason Li 006 (2021)

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (FOCS, 2022)

Augmenting Edge Connectivity via Isolating Cuts. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (SODA, 2022)

Edge connectivity augmentation in near-linear time. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (STOC, 2022)

Breaking the nk barrier for minimum k-cut on simple graphs. - Zhiyang He; Jason Li 006 (STOC, 2022)

Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (STOC, 2022)

Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (CoRR, 2022)

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (CoRR, 2022)

Optimal Bounds for the k-cut Problem. - Anupam Gupta 001; David G. Harris 001; Euiwoong Lee; Jason Li 006 (J. ACM, 2022)

Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time. - Jason Li 006; Jesper Nederlof (ACM Trans. Algorithms, 2022)

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. - Amir Abboud; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak (FOCS, 2023)

Near-Linear Time Approximations for Cut Problems via Fair Cuts. - Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (SODA, 2023)

Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. - Ruoxu Cen; William He; Jason Li 006; Debmalya Panigrahi (SODA, 2023)

A Local Search-Based Approach for Set Covering. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006 (SOSA, 2023)

Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). - Jason Li 006; Debmalya Panigrahi; Laura Sanità; Thatchaphol Saranurak (Dagstuhl Reports, 2023)

Deterministic Minimum Steiner Cut in Maximum Flow Time. - Matthew Ding 001; Jason Li 006 (ESA, 2024)

Beyond the Quadratic Time Barrier for Network Unreliability. - Ruoxu Cen; William He; Jason Li 006; Debmalya Panigrahi (SODA, 2024)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. - Monika Henzinger; Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2024)

Approximating Small Sparse Cuts. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (STOC, 2024)

Hypergraph Unreliability in Quasi-Polynomial Time. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (STOC, 2024)

Low-Step Multi-commodity Flow Emulators. - Bernhard Haeupler; D. Ellis Hershkowitz; Jason Li 006; Antti Roeyskoe; Thatchaphol Saranurak (STOC, 2024)

Approximate Gomory-Hu Tree is Faster than ( boldsymbol{n} , boldsymbol{- , 1} ) Maximum Flows. - Jason Li 006; Debmalya Panigrahi (SIAM J. Comput., 2024)

Matroid-based TSP rounding for half-integral solutions. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006; Marcin Mucha; Heather Newman; Sherry Sarkar (Math. Program., 2024)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (ICALP, 2025)

Space Complexity of Minimum Cut Problems in Single-Pass Streams. - Matthew Ding 001; Alexandro Garces; Jason Li 006; Honghao Lin; Jelani Nelson; Vihan Shah; David P. Woodruff (ITCS, 2025)

Unbreakable Decomposition in Close-to-Linear Time. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Yaowei Long; Thatchaphol Saranurak (SODA, 2025)

Congestion-Approximators from the Bottom Up. - Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2025)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation. - Antoine El-Hayek; Monika Henzinger; Jason Li 006 (SODA, 2025)

Network Unreliability in Almost-Linear Time. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (STOC, 2025)

Local Sherman's Algorithm for Multi-commodity Flow. - Jason Li 006; Thatchaphol Saranurak (CoRR, 2025)

Improved Directed Expander Decompositions. - Henry L. Fleischmann; George Z. Li; Jason Li 006 (CoRR, 2025)

Fast Algorithms for Graph Arboricity and Related Problems. - Ruoxu Cen; Henry L. Fleischmann; George Z. Li; Jason Li 006; Debmalya Panigrahi (CoRR, 2025)

Deterministic Almost-Linear-Time Gomory-Hu Trees. - Amir Abboud; Rasmus Kyng; Jason Li 006; Debmalya Panigrahi; Maximilian Probst Gutenberg; Thatchaphol Saranurak; Weixuan Yuan; Wuwei Yuan (CoRR, 2025)