| 2026 | STOC | Fully Dynamic Set Cover: Worst-Case Recourse and Update Time. | Sayan Bhattacharya, Ruoxu Cen, Debmalya Panigrahi |
| 2025 | FOCS | Fast Algorithms for Graph Arboricity and Related Problems. | Ruoxu Cen, Henry L. Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi |
| 2025 | STOC | Network Unreliability in Almost-Linear Time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2024 | SODA | Beyond the Quadratic Time Barrier for Network Unreliability. | Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2024 | STOC | Hypergraph Unreliability in Quasi-Polynomial Time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2023 | SODA | Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. | Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2022 | SODA | Augmenting Edge Connectivity via Isolating Cuts. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2022 | STOC | Edge connectivity augmentation in near-linear time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2021 | FOCS | Minimum Cuts in Directed Graphs via Partial Sparsification. | Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud |
| 2021 | ICALP | Sparsification of Directed Graphs via Cut Balance. | Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun |
| 2020 | ICALP | Roundtrip Spanners with (2k-1) Stretch. | Ruoxu Cen, Ran Duan, Yong Gu |