Ruoxu Cen（岑若虚）
I am a forth-year PhD student at Duke University. My research interest is graph algorithms of theoretical computer science. I am fortunate to be advised by Prof. Debmalya Panigrahi. My recent work is on a wide variety of problems related to minimum cuts.
Prior to that, I received my bachelor degree from Yao Class at Tsinghua University.
Contact info:
ruoxu.cen [at] duke.edu
Publications
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Hypergraph Unreliability in Quasi-Polynomial Time. [ACM] [arXiv]
STOC 2024Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi.
Beyond the Quadratic Time Barrier for Network Unreliability. [SIAM] [arXiv]
SODA 2024Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi.
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. [SIAM] [arXiv]
SODA 2023Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Edge Connectivity Augmentation in Near-Linear Time. [ACM] [arXiv]
STOC 2022Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Augmenting Edge Connectivity via Isolating Cuts. [SIAM] [arXiv]
SODA 2022Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, and Thatchaphol Saranurak.
Minimum Cuts in Directed Graphs via Partial Sparsification. [arXiv]
FOCS 2021Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun.
Sparsification of Directed Graphs via Cut Balance. [pdf]
ICALP 2021Ruoxu Cen, Ran Duan, Yong Gu.
Roundtrip Spanners with (2k-1) Stretch. [pdf]
ICALP 2020