Li Chen

Orcid: 0000-0003-2585-6027

Affiliations:
  • Carnegie Mellon University, PA, USA
  • Georgia Tech, GA, USA (former)


According to our database1, Li Chen authored at least 15 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.
CoRR, 2024

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

High-Accuracy Multicommodity Flows via Iterative Refinement.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.
Commun. ACM, December, 2023

Hinted Data Structures with Applications to Optimization and Learning.
PhD thesis, 2023

A Simple Framework for Finding Balanced Sparse Cuts via APSP.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Exponential Convergence of Sinkhorn Under Regularization Scheduling.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
On the Power of Learning-Augmented BSTs.
CoRR, 2022

Minimum Coverage Instrumentation.
CoRR, 2022

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
𝓁<sub>2</sub>-norm Flow Diffusion in Near-Linear Time.
CoRR, 2021

2-norm Flow Diffusion in Near-Linear Time.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020


  Loading...