default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason Li 0006
Person information
- affiliation: University of California Berkeley, Simons Institute for the Theory of Computing, CA, USA
- affiliation (former, PhD 2021): Carnegie Mellon University, Pittsburgh, PA, USA
Other persons with the same name
- Jason Li — disambiguation page
- Jason Li 0001 — SanDisk Corp., Milpitas, USA
- Jason Li 0002
![[0000-0002-1150-3549]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1150-3549")
— Peter MacCallum Cancer Centre, Melbourne, Bioinformatics Core Facility (and 1 more) - Jason Li 0003 — University of California, Davis, USA (and 1 more)
- Jason Li 0004 — Brown University, Providence, Education Department
- Jason Li 0005 — CALSON Technologies, Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j3]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-based TSP rounding for half-integral solutions. Math. Program. 206(1): 541-576 (2024)- [c44]Matthew Ding, Jason Li:
Deterministic Minimum Steiner Cut in Maximum Flow Time. ESA 2024: 46:1-46:14 - [c43]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. SODA 2024: 1542-1567 - [c42]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA 2024: 3089-3139 - [c41]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-commodity Flow Emulators. STOC 2024: 71-82 - [c40]Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. STOC 2024: 319-330 - [c39]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. STOC 2024: 1700-1711 - [i47]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR abs/2401.05627 (2024) - [i46]Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak:
Approximating Small Sparse Cuts. CoRR abs/2403.08983 (2024) - [i45]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Hypergraph Unreliability in Quasi-Polynomial Time. CoRR abs/2403.18781 (2024) - [i44]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-Commodity Flow Emulators. CoRR abs/2406.14384 (2024) - [i43]Jason Li, Satish Rao, Di Wang:
Congestion-Approximators from the Bottom Up. CoRR abs/2407.04976 (2024) - [i42]Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak:
Unbreakable Decomposition in Close-to-Linear Time. CoRR abs/2408.09368 (2024) - 2023
- [c38]Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS 2023: 2204-2212 - [c37]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA 2023: 240-275 - [c36]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. SODA 2023: 2449-2488 - [c35]Anupam Gupta, Euiwoong Lee, Jason Li:
A Local Search-Based Approach for Set Covering. SOSA 2023: 1-11 - [i41]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Beyond the Quadratic Time Barrier for Network Unreliability. CoRR abs/2304.06552 (2023) - [i40]Matthew Ding, Jason Li:
Deterministic Minimum Steiner Cut in Maximum Flow Time. CoRR abs/2312.16415 (2023) - [i39]Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak:
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports 13(10): 76-89 (2023) - 2022
- [j2]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. J. ACM 69(1): 2:1-2:18 (2022) - [j1]Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time. ACM Trans. Algorithms 18(4): 34:1-34:26 (2022) - [c34]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS 2022: 884-895 - [c33]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO 2022: 305-318 - [c32]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Augmenting Edge Connectivity via Isolating Cuts. SODA 2022: 3237-3252 - [c31]Zhiyang He, Jason Li:
Breaking the nk barrier for minimum k-cut on simple graphs. STOC 2022: 131-136 - [c30]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Edge connectivity augmentation in near-linear time. STOC 2022: 137-150 - [c29]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC 2022: 478-487 - [i38]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. CoRR abs/2203.00751 (2022) - [i37]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. CoRR abs/2204.05874 (2022) - [i36]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Edge Connectivity Augmentation in Near-Linear Time. CoRR abs/2205.04636 (2022) - [i35]Vincent Cohen-Addad, Jason Li:
On the Fixed-Parameter Tractability of Capacitated Clustering. CoRR abs/2208.14129 (2022) - [i34]Anupam Gupta, Euiwoong Lee, Jason Li:
A Local Search-Based Approach for Set Covering. CoRR abs/2211.04444 (2022) - [i33]Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi:
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. CoRR abs/2211.05769 (2022) - 2021
- [b1]Jason Li:
Preconditioning and Locality in Algorithm Design. Carnegie Mellon University, USA, 2021 - [c28]Zhiyang He, Jason Li, Magnus Wahlström:
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA 2021: 52:1-52:14 - [c27]Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS 2021: 1124-1134 - [c26]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - [c25]Anupam Gupta, Euiwoong Lee, Jason Li:
The Connectivity Threshold for Dense Graphs. SODA 2021: 89-105 - [c24]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex connectivity in poly-logarithmic max-flows. STOC 2021: 317-329 - [c23]Jason Li:
Deterministic mincut in almost-linear time. STOC 2021: 384-395 - [c22]Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li:
A quasipolynomial (2 + ε)-approximation for planar sparsest cut. STOC 2021: 1056-1069 - [c21]Jason Li, Debmalya Panigrahi:
Approximate Gomory-Hu tree is faster than n - 1 max-flows. STOC 2021: 1738-1748 - [i32]Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Vertex Connectivity in Poly-logarithmic Max-flows. CoRR abs/2104.00104 (2021) - [i31]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR abs/2104.07898 (2021) - [i30]Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li:
A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut. CoRR abs/2105.15187 (2021) - [i29]Jason Li, Thatchaphol Saranurak:
Deterministic Weighted Expander Decomposition in Almost-linear Time. CoRR abs/2106.01567 (2021) - [i28]Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. CoRR abs/2106.02233 (2021) - [i27]Jason Li, Debmalya Panigrahi:
Deterministic Min-cut in Poly-logarithmic Max-flows. CoRR abs/2111.02008 (2021) - [i26]Jason Li, Debmalya Panigrahi:
Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows. CoRR abs/2111.02022 (2021) - [i25]Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Augmenting Edge Connectivity via Isolating Cuts. CoRR abs/2111.02361 (2021) - [i24]Zhiyang He, Jason Li:
Breaking the nk Barrier for Minimum $k$-cut on Simple Graphs. CoRR abs/2111.03221 (2021) - [i23]Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi:
Gomory-Hu Tree in Subcubic Time. CoRR abs/2111.04958 (2021) - [i22]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - [i21]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR abs/2111.09290 (2021) - 2020
- [c20]Jason Li, Debmalya Panigrahi:
Deterministic Min-cut in Poly-logarithmic Max-flows. FOCS 2020: 85-92 - [c19]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS 2020: 1158-1167 - [c18]Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time. SODA 2020: 971-989 - [c17]Jason Li:
Faster parallel algorithm for approximate shortest path. STOC 2020: 308-321 - [c16]Anupam Gupta, Euiwoong Lee, Jason Li:
The Karger-Stein algorithm is optimal for k-cut. STOC 2020: 473-484 - [i20]Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
Optimal Bounds for the k-cut Problem. CoRR abs/2005.08301 (2020) - [i19]Zhiyang He, Jason Li:
Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs. CoRR abs/2011.13485 (2020)
2010 – 2019
- 2019
- [c15]Jason Li:
Faster Minimum k-cut of a Simple Graph. FOCS 2019: 1056-1077 - [c14]Vincent Cohen-Addad, Jason Li:
On the Fixed-Parameter Tractability of Capacitated Clustering. ICALP 2019: 41:1-41:14 - [c13]Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li:
Tight FPT Approximations for k-Median and k-Means. ICALP 2019: 42:1-42:14 - [c12]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. SODA 2019: 1731-1749 - [c11]John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, Jason Li:
Distributed Computation in Node-Capacitated Networks. SPAA 2019: 69-79 - [c10]Jason Li, Merav Parter:
Planar diameter via metric compression. STOC 2019: 152-163 - [c9]Anupam Gupta, Euiwoong Lee, Jason Li:
The number of minimum k-cuts: improving the Karger-Stein bound. STOC 2019: 229-240 - [i18]Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li:
Tight FPT Approximations for $k$-Median and k-Means. CoRR abs/1904.12334 (2019) - [i17]Anupam Gupta, Euiwoong Lee, Jason Li:
The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR abs/1906.00417 (2019) - [i16]Jason Li:
Faster Minimum k-cut of a Simple Graph. CoRR abs/1910.02665 (2019) - [i15]Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR abs/1910.07950 (2019) - [i14]Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak:
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR abs/1910.08025 (2019) - [i13]Jason Li:
Faster Parallel Algorithm for Approximate Shortest Path. CoRR abs/1911.01626 (2019) - [i12]Anupam Gupta, Euiwoong Lee, Jason Li:
The Karger-Stein Algorithm is Optimal for k-cut. CoRR abs/1911.09165 (2019) - 2018
- [c8]Anupam Gupta, Euiwoong Lee, Jason Li:
Faster Exact and Approximate Algorithms for k-Cut. FOCS 2018: 113-123 - [c7]Anupam Gupta, Amit Kumar, Jason Li:
Non-Preemptive Flow-Time Minimization via Rejections. ICALP 2018: 70:1-70:13 - [c6]Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. PODC 2018: 465-474 - [c5]Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. SODA 2018: 2821-2837 - [c4]Mohsen Ghaffari, Jason Li:
Improved distributed algorithms for exact shortest paths. STOC 2018: 431-444 - [c3]Mohsen Ghaffari, Jason Li:
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. DISC 2018: 31:1-31:16 - [c2]Bernhard Haeupler, Jason Li:
Faster Distributed Shortest Path Approximations via Shortcuts. DISC 2018: 33:1-33:14 - [i11]Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. CoRR abs/1801.06237 (2018) - [i10]Bernhard Haeupler, Jason Li:
Faster Distributed Shortest Path Approximations via Shortcuts. CoRR abs/1802.03671 (2018) - [i9]Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk:
Losing Treewidth by Separating Subsets. CoRR abs/1804.01366 (2018) - [i8]Mohsen Ghaffari, Jason Li:
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. CoRR abs/1805.04764 (2018) - [i7]John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, Christian Scheideler:
Distributed Computation in the Node-Congested Clique. CoRR abs/1805.07294 (2018) - [i6]Anupam Gupta, Amit Kumar, Jason Li:
Non-Preemptive Flow-Time Minimization via Rejections. CoRR abs/1805.09602 (2018) - [i5]Jason Li:
Distributed Treewidth Computation. CoRR abs/1805.10708 (2018) - [i4]Anupam Gupta, Euiwoong Lee, Jason Li:
Faster Exact and Approximate Algorithms for k-Cut. CoRR abs/1807.08144 (2018) - 2017
- [c1]Jason Li, Ryan O'Donnell:
Bounding Laconic Proof Systems by Solving CSPs in Parallel. SPAA 2017: 95-100 - [i3]Anupam Gupta, Euiwoong Lee, Jason Li:
An FPT Algorithm Beating 2-Approximation for k-Cut. CoRR abs/1710.08488 (2017) - [i2]Mohsen Ghaffari, Jason Li:
Improved Distributed Algorithms for Exact Shortest Paths. CoRR abs/1712.09121 (2017) - 2016
- [i1]Jason Li, Ryan O'Donnell:
Bounding laconic proof systems by solving CSPs in parallel. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
