Profiles2020-2026
Jason Li
Carnegie Mellon University
18Papers
3Last author
25Unique co-authors
5First author
2Solo
First and last author come from byline position, which some venues assign alphabetically.
Recent papers18
- Deterministic Padded Decompositions and Negative-Weight Shortest PathsAuthor 1 of 1STOC 2026 · 6 citations
- Separator Theorem for Minor-Free Graphs in Linear TimeAuthor 4 of 5STOC 2026 · 4 citations
- Shortcutting for Negative-Weight Shortest PathsAuthor 2 of 4STOC 2026 · 3 citations
- Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial TimeAuthor 3 of 3SODA 2026
- Faster Negative-Weight Shortest Paths and Directed Low-Diameter DecompositionsAuthor 1 of 3SODA 2026
- Deterministic Almost-Linear-Time Gomory-Hu TreesAuthor 4 of 9FOCS 2025 · 10 citations
- Congestion-Approximators from the Bottom UpAuthor 1 of 3SODA 2025 · 3 citations
- Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut GraphsAuthor 3 of 5FOCS 2025 · 2 citations
- Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per OperationAuthor 3 of 3SODA 2025
- Low-Step Multi-commodity Flow EmulatorsAuthor 3 of 4STOC 2024 · 3 citations
- Hypergraph Unreliability in Quasi-Polynomial TimeAuthor 2 of 3STOC 2024 · 1 citation
- All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear TimeAuthor 2 of 4FOCS 2023 · 11 citations
- Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithmsAuthor 5 of 5STOC 2022 · 22 citations
- Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic TimeAuthor 3 of 6FOCS 2022 · 16 citations
- Augmenting Edge Connectivity via Isolating CutsAuthor 2 of 3SODA 2022 · 7 citations
- Vertex connectivity in poly-logarithmic max-flowsAuthor 2 of 8STOC 2021 · 31 citations
- Approximate Gomory-Hu tree is faster than n - 1 max-flowsAuthor 1 of 1STOC 2021 · 15 citations
- Deterministic Min-cut in Poly-logarithmic Max-flowsAuthor 1 of 3FOCS 2020 · 36 citations
