Jason Li

most citedUnbreakable Decomposition in Close-to-Linear Time

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2025

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs

Aaron Bernstein, Joakim Blikstad, Jason Li +2

We give a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from ${1, \dots, U}$ in $O ~ (n^{2} lo g U)$ time,…

cs.DS2025

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs

Aditya Anand, Euiwoong Lee, Jason Li +1

Given a directed graph $G$ with $n$ vertices and $m$ edges, a parameter $k$ and two disjoint subsets $S, T \subseteq V (G)$ , we show that the number of all-subsets important separato…

cs.DS2024★ 1 cited

Unbreakable Decomposition in Close-to-Linear Time

Aditya Anand, Euiwoong Lee, Jason Li +2

Unbreakable decomposition, introduced by Cygan et al. (SICOMP'19) and Cygan et al. (TALG'20), has proven to be one of the most powerful tools for parameterized graph cut problems i…