Characterization and Linear-Time Recognition of Paired Threshold Graphs. - Yixin Cao 001; Guozhen Rong; Jianxin Wang 001 (WG, 2020)

Cycle Extendability of Hamiltonian Strongly Chordal Graphs. - Guozhen Rong; Wenjun Li 001; Jianxin Wang 001; Yongjie Yang 001 (SIAM J. Discret. Math., 2021)

A (2 + ϵ)k-vertex kernel for the dual coloring problem. - Wenjun Li 001; Yang Ding; Yongjie Yang 001; Guozhen Rong (Theor. Comput. Sci., 2021)

Reconstruction and verification of chordal graphs with a distance oracle. - Guozhen Rong; Wenjun Li 001; Yongjie Yang 001; Jianxin Wang 001 (Theor. Comput. Sci., 2021)

Graph Searches and Their End Vertices. - Guozhen Rong; Yixin Cao 001; Jian-xin Wang 001; Zhifeng Wang (Algorithmica, 2022)

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network. - Feng Shi 003; Hangcheng Li; Guozhen Rong; Zhen Zhang 025; Jianxin Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries. - Guozhen Rong; Yongjie Yang 001; Wenjun Li 001; Jianxin Wang 001 (Theor. Comput. Sci., 2022)

A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs. - Guozhen Rong; Yongjie Yang 001; Wenjun Li 001 (MFCS, 2023)

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation. - Zhen Zhang 025; Junfeng Yang; Limei Liu; Xuesong Xu; Guozhen Rong; Qilong Feng (AAAI, 2024)

On Online Approximation Algorithms for Two-Stage Bins. - Guangwei Wu; Hongyun He; Guozhen Rong; Feng Shi 003; Yongjie Yang 001 (COCOON (1), 2025)

Towards a theoretical understanding of why local search works for clustering with fair-center representation. - Zhen Zhang; Junfeng Yang; Limei Liu; Xuesong Xu; Guozhen Rong; Qilong Feng (Inf. Comput., 2025)