| Maximum flow and minimum-cost flow in almost-linear time L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 321 | 2022 |
| Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances J van den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, D Wang Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 155 | 2021 |
| Faster divergence maximization for faster maximum flow YP Liu, A Sidford arXiv preprint arXiv:2003.08929, 2020 | 98* | 2020 |
| Faster energy maximization for faster maximum flow YP Liu, A Sidford Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 90 | 2020 |
| Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao Y Gao, YP Liu, R Peng 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 81 | 2022 |
| Parallel reachability in almost linear work and square root depth A Jambulapati, YP Liu, A Sidford 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 56 | 2019 |
| Discrepancy minimization via a self-balancing walk R Alweiss, YP Liu, M Sawhney Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 52 | 2021 |
| A deterministic almost-linear time algorithm for minimum-cost flow J Van Den Brand, L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, ... 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 41 | 2023 |
| Faster maxflow via improved dynamic spectral vertex sparsifiers J van den Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, ... Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 37 | 2022 |
| Vertex Sparsification for Edge Connectivity P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 30* | 2021 |
| Near-optimal approximate discrete and continuous submodular function minimization B Axelrod, YP Liu, A Sidford Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 27 | 2020 |
| Reproducibility and pseudo-determinism in log-space O Grossman, YP Liu Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 27 | 2019 |
| Online edge coloring via tree recurrences and correlation decay J Kulkarni, YP Liu, A Sah, M Sawhney, J Tarnawski Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 23 | 2022 |
| Improved iteration complexities for overconstrained p-norm regression A Jambulapati, YP Liu, A Sidford Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 23 | 2022 |
| Minor Sparsifiers and the Distributed Laplacian Paradigm S Forster, G Goranci, YP Liu, R Peng, X Sun, M Ye 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 23 | 2022 |
| Chaining, group leverage score overestimates, and fast spectral hypergraph sparsification A Jambulapati, YP Liu, A Sidford Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 196-206, 2023 | 16 | 2023 |
| Short cycles via low-diameter decompositions YP Liu, S Sachdeva, Z Yu Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 16 | 2019 |
| On the upper tail problem for random hypergraphs YP Liu, Y Zhao Random Structures & Algorithms 58 (2), 179-220, 2021 | 15 | 2021 |
| Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, st Shortest Path, and Minimum-Cost Flow L Chen, R Kyng, YP Liu, S Meierhans, M Probst Gutenberg Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1165-1173, 2024 | 12 | 2024 |
| Sparsifying sums of norms A Jambulapati, JR Lee, YP Liu, A Sidford 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 12 | 2023 |
