Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. - Li Chen 028; Gramoz Goranci; Monika Henzinger; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

2-norm Flow Diffusion in Near-Linear Time. - Li Chen 028; Richard Peng; Di Wang 005 (FOCS, 2021)

𝓁2-norm Flow Diffusion in Near-Linear Time. - Li Chen 028; Richard Peng; Di Wang 005 (CoRR, 2021)

Minimum Coverage Instrumentation. - Li Chen 028; Ellis Hoag; Kyungwoo Lee; Julián Mestre; Sergey Pupyrev (CoRR, 2022)

On the Power of Learning-Augmented BSTs. - Jingbang Chen; Li Chen 028 (CoRR, 2022)

Exponential Convergence of Sinkhorn Under Regularization Scheduling. - Jingbang Chen; Li Chen 028; Yang P. Liu; Richard Peng; Arvind Ramaswami (ACDA, 2023)

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. - Jan van den Brand; Li Chen 028; Richard Peng; Rasmus Kyng; Yang P. Liu; Maximilian Probst Gutenberg; Sushant Sachdeva; Aaron Sidford (FOCS, 2023)

A Simple Framework for Finding Balanced Sparse Cuts via APSP. - Li Chen 028; Rasmus Kyng; Maximilian Probst Gutenberg; Sushant Sachdeva (SOSA, 2023)

Hinted Data Structures with Applications to Optimization and Learning. - Li Chen 028 (2023)

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva (Commun. ACM, 2023)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. - Jan van den Brand; Li Chen 028; Rasmus Kyng; Yang P. Liu; Simon Meierhans; Maximilian Probst Gutenberg; Sushant Sachdeva (FOCS, 2024)

High-Accuracy Multicommodity Flows via Iterative Refinement. - Li Chen 028; Mingquan Ye (ICALP, 2024)

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. - Jan van den Brand; Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva; Aaron Sidford (SODA, 2024)

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Simon Meierhans; Maximilian Probst Gutenberg (STOC, 2024)

Accelerated Approximate Optimization of Multi-commodity Flows on Directed Graphs. - Li Chen 028; Andrei Graur; Aaron Sidford (STOC, 2025)

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. - Li Chen 028; Rasmus Kyng; Yang P. Liu; Richard Peng; Maximilian Probst Gutenberg; Sushant Sachdeva (J. ACM, 2025)