Roundtrip Spanners with $(2k-1)$ Stretch. - Ruoxu Cen; Ran Duan (CoRR, 2019)

Roundtrip Spanners with (2k-1) Stretch. - Ruoxu Cen; Ran Duan; Yong Gu (ICALP, 2020)

Minimum Cuts in Directed Graphs via Partial Sparsification. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Kent Quanrud (FOCS, 2021)

Sparsification of Directed Graphs via Cut Balance. - Ruoxu Cen; Yu Cheng 002; Debmalya Panigrahi; Kevin Sun 001 (ICALP, 2021)

Minimum Cuts in Directed Graphs via √n Max-Flows. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak (CoRR, 2021)

Augmenting Edge Connectivity via Isolating Cuts. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (SODA, 2022)

Edge connectivity augmentation in near-linear time. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (STOC, 2022)

Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. - Ruoxu Cen; William He; Jason Li 006; Debmalya Panigrahi (SODA, 2023)

Beyond the Quadratic Time Barrier for Network Unreliability. - Ruoxu Cen; William He; Jason Li 006; Debmalya Panigrahi (SODA, 2024)

Hypergraph Unreliability in Quasi-Polynomial Time. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (STOC, 2024)

Network Unreliability in Almost-Linear Time. - Ruoxu Cen; Jason Li 006; Debmalya Panigrahi (STOC, 2025)

Fast Algorithms for Graph Arboricity and Related Problems. - Ruoxu Cen; Henry L. Fleischmann; George Z. Li; Jason Li 006; Debmalya Panigrahi (CoRR, 2025)