Jason Li

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Deterministic near-linear time minimum cut in weighted graphs	2024-11-28	Paper
Beyond the quadratic time barrier for network unreliability	2024-11-28	Paper
Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows	2024-08-27	Paper
Matroid-based TSP rounding for half-integral solutions	2024-08-20	Paper
Augmenting edge connectivity via isolating cuts	2024-07-19	Paper
Near-linear time approximations for cut problems via fair cuts	2024-05-14	Paper
Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows	2024-05-14	Paper
A local search-based approach for set covering	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6147253	2024-01-15	Paper
Edge connectivity augmentation in near-linear time	2023-12-08	Paper
Breaking the n ^k barrier for minimum k -cut on simple graphs	2023-12-08	Paper
Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms	2023-12-08	Paper
Deterministic mincut in almost-linear time	2023-11-14	Paper
A quasipolynomial (2 + ε )-approximation for planar sparsest cut	2023-11-14	Paper
Vertex connectivity in poly-logarithmic max-flows	2023-11-14	Paper
Approximate Gomory–Hu tree is faster than n – 1 max-flows	2023-11-14	Paper
Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time	2023-10-31	Paper
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs	2023-09-20	Paper
Matroid-based TSP rounding for half-integral solutions	2022-08-16	Paper
On the fixed-parameter tractability of capacitated clustering	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091192	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090923	2022-07-21	Paper
Faster distributed shortest path approximations via shortcuts	2022-07-21	Paper
Optimal Bounds for the k -cut Problem	2022-03-31	Paper
Non-preemptive flow-time minimization via rejections	2021-07-28	Paper
Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time	2021-02-02	Paper
Faster parallel algorithm for approximate shortest path	2021-01-19	Paper
The Karger-Stein algorithm is optimal for k-cut	2021-01-19	Paper
Planar diameter via metric compression	2020-01-30	Paper
The number of minimum \(k\)-cuts: improving the Karger-Stein bound	2020-01-30	Paper
Losing Treewidth by Separating Subsets	2019-10-15	Paper
Minor excluded network families admit fast distributed algorithms	2019-09-19	Paper
Improved distributed algorithms for exact shortest paths	2019-08-22	Paper
An FPT algorithm beating 2-approximation for \(k\)-cut	2018-03-15	Paper
Lower central series of a free associative algebra over the integers and finite fields.	2013-06-24	Paper

Research outcomes over time

This page was built for person: Jason Li