近期发表的与项目有关的主要论文包括(其中本人以黑体加以强调,通讯作者以“*”标出):期刊论文: [1] Guozhen Rong, Yixin Cao, Jianxin Wang, and Zhifeng Wang, Graph Searches and Their End Vertices. Algorithmica, 2022. 84(9): p. 2642-2666. (CCF-B类期刊) [2] Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang: Cycle Extendability of Hamiltonian Strongly Chordal Graphs. SIAM J. Discret. Math. 35(3): 2115-2128 (2021) (CCF-C类期刊) [3] Guozhen Rong, Wenjun Li, Yongjie Yang, and Jianxin Wang, Reconstruction and verification of chordal graphs with a distance oracle. Theor. Comput. Sci., 2021. 859: p. 48-56. (CCF-B类期刊) [4] Guozhen Rong, Yongjie Yang, Wenjun Li, and Jianxin Wang, A divide-and-conquer approach for reconstruction of { }-free graphs via betweenness queries. Theor. Comput. Sci., 2022. 917: p. 1-11. (CCF-B类期刊) [5] Wenjun Li, Yang Ding, Yongjie Yang, and Guozhen Rong*, A (2 + ϵ)k-vertex kernel for the dual coloring problem. Theoretical Computer Science, 2021. 868: p. 6-11. (CCF-B类期刊,通讯作者) 会议论文: [1] Guozhen Rong, Yongjie Yang, and Wenjun Li, A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs, International Symposium on Mathematical Foundations of Computer Science (MFCS), 2023. p. 77:1-77:15. (CCF-C类会议) [2] Yixin Cao, Zhifeng Wang, Guozhen Rong, and Jianxin Wang, Graph Searches and Their End Vertices. in International Symposium on Algorithms and Computation (ISAAC), 2019. p. 1:1-1:18. (CCF-C类会议) [3] Yixin Cao, Guozhen Rong*, and Jianxin Wang. Characterization and Linear-Time Recognition of Paired Threshold Graphs. in International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2020. p. 298-309. (理论计算机科学领域国际知名会议) |
|