Jason Li - RankMe

128 papers A* 46A 5B 4Misc 1Journal 70Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bellman-Ford in Almost-Linear Time for Dense Graphs. CoRR George Z. Li, Jason Li, Junkai Zhang
2026	A*	`conf`	Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time. SODA Antoine El-Hayek, Monika Henzinger, Jason Li
2026	A*	`conf`	Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions. SODA Jason Li, Connor Mowry, Satish Rao
2025	B	`conf`	A Simple and Fast Algorithm for Fair Cuts. IPCO Jason Li, Owen Li
2025	A*	`conf`	All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. ICALP Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2025	J	`jnl`	All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. CoRR Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2025	Misc	`conf`	Can we make FCC Experts out of LLMs? HotMobile Atul Bansal, Veronica Muriga, Jason Li, Lucy Duan, Swarun Kumar
2025	A*	`conf`	Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs. FOCS Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu
2025	J	`jnl`	Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs. CoRR Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu
2025	A*	`conf`	Congestion-Approximators from the Bottom Up. SODA Jason Li, Satish Rao, Di Wang
2025	A*	`conf`	Deterministic Almost-Linear-Time Gomory-Hu Trees. FOCS Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan
2025	J	`jnl`	Deterministic Almost-Linear-Time Gomory-Hu Trees. CoRR Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan
2025	J	`jnl`	Deterministic Minimum Cut in Poly-logarithmic Maximum Flows. J. ACM Jason Li, Debmalya Panigrahi
2025	J	`jnl`	Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time. CoRR Antoine El-Hayek, Monika Henzinger, Jason Li
2025	A*	`conf`	Fast Algorithms for Graph Arboricity and Related Problems. FOCS Ruoxu Cen, Henry L. Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi
2025	J	`jnl`	Fast Algorithms for Graph Arboricity and Related Problems. CoRR Ruoxu Cen, Henry L. Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi
2025	J	`jnl`	Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions. CoRR Jason Li, Connor Mowry, Satish Rao
2025	J	`jnl`	Faster Weak Expander Decompositions and Approximate Max Flow. CoRR Henry L. Fleischmann, George Z. Li, Jason Li
2025	A*	`conf`	Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation. SODA Antoine El-Hayek, Monika Henzinger, Jason Li
2025	J	`jnl`	Improved Directed Expander Decompositions. CoRR Henry L. Fleischmann, George Z. Li, Jason Li
2025	J	`jnl`	Local Sherman's Algorithm for Multi-commodity Flow. CoRR Jason Li, Thatchaphol Saranurak
2025	A*	`conf`	Network Unreliability in Almost-Linear Time. STOC Ruoxu Cen, Jason Li, Debmalya Panigrahi
2025	J	`jnl`	Network Unreliability in Almost-Linear Time. CoRR Ruoxu Cen, Jason Li, Debmalya Panigrahi
2025	J	`jnl`	Shortcutting for Negative-Weight Shortest Path. CoRR George Z. Li, Jason Li, Satish Rao, Junkai Zhang
2025	A	`conf`	Space Complexity of Minimum Cut Problems in Single-Pass Streams. ITCS Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff
2025	A*	`conf`	Unbreakable Decomposition in Close-to-Linear Time. SODA Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak
2025	J	`jnl`	Vertex Connectivity in Poly-logarithmic Max-Flows. J. ACM Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2024	J	`jnl`	A Bottom-Up Algorithm for Negative-Weight SSSP with Integrated Negative Cycle Finding. CoRR Jason Li, Connor Mowry
2024	J	`jnl`	A Simple and Fast Algorithm for Fair Cuts. CoRR Jason Li, Owen Li
2024	J	`jnl`	Approximate Gomory-Hu Tree is Faster than $\boldsymbol{n}\,\boldsymbol{-\, 1}$ Maximum Flows. SIAM J. Comput. Jason Li, Debmalya Panigrahi
2024	A*	`conf`	Approximating Small Sparse Cuts. STOC Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2024	J	`jnl`	Approximating Small Sparse Cuts. CoRR Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak
2024	A*	`conf`	Beyond the Quadratic Time Barrier for Network Unreliability. SODA Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi
2024	J	`jnl`	Congestion-Approximators from the Bottom Up. CoRR Jason Li, Satish Rao, Di Wang
2024	A	`conf`	Deterministic Minimum Steiner Cut in Maximum Flow Time. ESA Matthew Ding, Jason Li
2024	A*	`conf`	Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA Monika Henzinger, Jason Li, Satish Rao, Di Wang
2024	J	`jnl`	Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR Monika Henzinger, Jason Li, Satish Rao, Di Wang
2024	J	`jnl`	Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation. CoRR Antoine El-Hayek, Monika Henzinger, Jason Li
2024	A*	`conf`	Hypergraph Unreliability in Quasi-Polynomial Time. STOC Ruoxu Cen, Jason Li, Debmalya Panigrahi
2024	J	`jnl`	Hypergraph Unreliability in Quasi-Polynomial Time. CoRR Ruoxu Cen, Jason Li, Debmalya Panigrahi
2024	J	`jnl`	Low-Step Multi-Commodity Flow Emulators. CoRR Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
2024	A*	`conf`	Low-Step Multi-commodity Flow Emulators. STOC Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
2024	J	`jnl`	Matroid-based TSP rounding for half-integral solutions. Math. Program. Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2024	J	`jnl`	Space Complexity of Minimum Cut Problems in Single-Pass Streams. CoRR Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff
2024	J	`jnl`	Unbreakable Decomposition in Close-to-Linear Time. CoRR Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak
2023	—	`conf`	A Local Search-Based Approach for Set Covering. SOSA Anupam Gupta, Euiwoong Lee, Jason Li
2023	A*	`conf`	All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. FOCS Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
2023	J	`jnl`	Beyond the Quadratic Time Barrier for Network Unreliability. CoRR Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi
2023	J	`jnl`	Deterministic Minimum Steiner Cut in Maximum Flow Time. CoRR Matthew Ding, Jason Li
2023	J	`jnl`	Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). Dagstuhl Reports Jason Li, Debmalya Panigrahi, Laura Sanità, Thatchaphol Saranurak
2023	A*	`conf`	Near-Linear Time Approximations for Cut Problems via Fair Cuts. SODA Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
2023	A*	`conf`	Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. SODA Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi
2022	J	`jnl`	A Local Search-Based Approach for Set Covering. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2022	A*	`conf`	Augmenting Edge Connectivity via Isolating Cuts. SODA Ruoxu Cen, Jason Li, Debmalya Panigrahi
2022	A*	`conf`	Breaking the STOC Zhiyang He, Jason Li
2022	A*	`conf`	Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. FOCS Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
2022	J	`jnl`	Detecting Feedback Vertex Sets of Size ACM Trans. Algorithms Jason Li, Jesper Nederlof
2022	J	`jnl`	Edge Connectivity Augmentation in Near-Linear Time. CoRR Ruoxu Cen, Jason Li, Debmalya Panigrahi
2022	A*	`conf`	Edge connectivity augmentation in near-linear time. STOC Ruoxu Cen, Jason Li, Debmalya Panigrahi
2022	J	`jnl`	Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time. CoRR Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
2022	B	`conf`	Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2022	J	`jnl`	On the Fixed-Parameter Tractability of Capacitated Clustering. CoRR Vincent Cohen-Addad, Jason Li
2022	J	`jnl`	Optimal Bounds for the J. ACM Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2022	J	`jnl`	Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. CoRR Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi
2022	A*	`conf`	Undirected (1+ STOC Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
2022	J	`jnl`	Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. CoRR Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
2021	A*	`conf`	A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
2021	J	`jnl`	A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. CoRR Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak
2021	J	`jnl`	A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut. CoRR Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li
2021	A*	`conf`	A quasipolynomial (2 + STOC Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li
2021	J	`jnl`	Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows. CoRR Jason Li, Debmalya Panigrahi
2021	A*	`conf`	Approximate Gomory-Hu tree is faster than STOC Jason Li, Debmalya Panigrahi
2021	J	`jnl`	Augmenting Edge Connectivity via Isolating Cuts. CoRR Ruoxu Cen, Jason Li, Debmalya Panigrahi
2021	J	`jnl`	Breaking the n CoRR Zhiyang He, Jason Li
2021	J	`jnl`	Deterministic Min-cut in Poly-logarithmic Max-flows. CoRR Jason Li, Debmalya Panigrahi
2021	J	`jnl`	Deterministic Weighted Expander Decomposition in Almost-linear Time. CoRR Jason Li, Thatchaphol Saranurak
2021	A*	`conf`	Deterministic mincut in almost-linear time. STOC Jason Li
2021	J	`jnl`	Gomory-Hu Tree in Subcubic Time. CoRR Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
2021	J	`jnl`	Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2021	A*	`conf`	Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud
2021	J	`jnl`	Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak
2021	J	`jnl`	Minimum Cuts in Directed Graphs via √n Max-Flows. CoRR Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak
2021	A	`conf`	Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA Zhiyang He, Jason Li, Magnus Wahlström
2021	—	`—`	Preconditioning and Locality in Algorithm Design. Jason Li
2021	A*	`conf`	The Connectivity Threshold for Dense Graphs. SODA Anupam Gupta, Euiwoong Lee, Jason Li
2021	J	`jnl`	Vertex Connectivity in Poly-logarithmic Max-flows. CoRR Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2021	A*	`conf`	Vertex connectivity in poly-logarithmic max-flows. STOC Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2020	A*	`conf`	A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
2020	A*	`conf`	Detecting Feedback Vertex Sets of Size SODA Jason Li, Jesper Nederlof
2020	A*	`conf`	Deterministic Min-cut in Poly-logarithmic Max-flows. FOCS Jason Li, Debmalya Panigrahi
2020	A*	`conf`	Faster parallel algorithm for approximate shortest path. STOC Jason Li
2020	J	`jnl`	Optimal Bounds for the k-cut Problem. CoRR Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2020	A*	`conf`	The Karger-Stein algorithm is optimal for k-cut. STOC Anupam Gupta, Euiwoong Lee, Jason Li
2020	J	`jnl`	Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs. CoRR Zhiyang He, Jason Li
2019	J	`jnl`	A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
2019	J	`jnl`	Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time. CoRR Jason Li, Jesper Nederlof
2019	J	`jnl`	Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex. CoRR Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
2019	B	`conf`	Distributed Computation in Node-Capacitated Networks. SPAA John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, Jason Li
2019	A*	`conf`	Faster Minimum k-cut of a Simple Graph. FOCS Jason Li
2019	J	`jnl`	Faster Minimum k-cut of a Simple Graph. CoRR Jason Li
2019	J	`jnl`	Faster Parallel Algorithm for Approximate Shortest Path. CoRR Jason Li
2019	A*	`conf`	Losing Treewidth by Separating Subsets. SODA Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2019	A*	`conf`	On the Fixed-Parameter Tractability of Capacitated Clustering. ICALP Vincent Cohen-Addad, Jason Li
2019	A*	`conf`	Planar diameter via metric compression. STOC Jason Li, Merav Parter
2019	J	`jnl`	The Karger-Stein Algorithm is Optimal for k-cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2019	J	`jnl`	The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2019	A*	`conf`	The number of minimum STOC Anupam Gupta, Euiwoong Lee, Jason Li
2019	J	`jnl`	Tight FPT Approximations for $k$-Median and k-Means. CoRR Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2019	A*	`conf`	Tight FPT Approximations for k-Median and k-Means. ICALP Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2018	A*	`conf`	An FPT Algorithm Beating 2-Approximation for SODA Anupam Gupta, Euiwoong Lee, Jason Li
2018	J	`jnl`	Distributed Computation in the Node-Congested Clique. CoRR John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, Christian Scheideler
2018	J	`jnl`	Distributed Treewidth Computation. CoRR Jason Li
2018	A	`conf`	Faster Distributed Shortest Path Approximations via Shortcuts. DISC Bernhard Haeupler, Jason Li
2018	J	`jnl`	Faster Distributed Shortest Path Approximations via Shortcuts. CoRR Bernhard Haeupler, Jason Li
2018	A*	`conf`	Faster Exact and Approximate Algorithms for k-Cut. FOCS Anupam Gupta, Euiwoong Lee, Jason Li
2018	J	`jnl`	Faster Exact and Approximate Algorithms for k-Cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2018	A*	`conf`	Improved distributed algorithms for exact shortest paths. STOC Mohsen Ghaffari, Jason Li
2018	J	`jnl`	Losing Treewidth by Separating Subsets. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2018	A*	`conf`	Minor Excluded Network Families Admit Fast Distributed Algorithms. PODC Bernhard Haeupler, Jason Li, Goran Zuzic
2018	J	`jnl`	Minor Excluded Network Families Admit Fast Distributed Algorithms. CoRR Bernhard Haeupler, Jason Li, Goran Zuzic
2018	A	`conf`	New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. DISC Mohsen Ghaffari, Jason Li
2018	J	`jnl`	New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. CoRR Mohsen Ghaffari, Jason Li
2018	A*	`conf`	Non-Preemptive Flow-Time Minimization via Rejections. ICALP Anupam Gupta, Amit Kumar, Jason Li
2018	J	`jnl`	Non-Preemptive Flow-Time Minimization via Rejections. CoRR Anupam Gupta, Amit Kumar, Jason Li
2017	J	`jnl`	An FPT Algorithm Beating 2-Approximation for k-Cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2017	B	`conf`	Bounding Laconic Proof Systems by Solving CSPs in Parallel. SPAA Jason Li, Ryan O'Donnell
2017	J	`jnl`	Improved Distributed Algorithms for Exact Shortest Paths. CoRR Mohsen Ghaffari, Jason Li
2016	J	`jnl`	Bounding laconic proof systems by solving CSPs in parallel. Electron. Colloquium Comput. Complex. Jason Li, Ryan O'Donnell