近几年代表性论文(更多论文请访问DBLP https://dblp.org/pid/67/6351-2.html):
[1] Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin*, Yao Xu, and An Zhang.
Approximating the directed path partition problems. Information and Computation, 297, 105150, 2024.
[2] Jingwei Xie, Yong Chen, An Zhang, and Guangting Chen*. Approximation Algorithms for Graph Partition into Bounded Independent Sets. Tsinghua Science and Technology, 28(6), 1063–1071, 2023.
[3] Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin*, Bing Su, and An Zhang. Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. Journal of Combinatorial Optimization. 43, 571-588, 2022.
[4] Yong Chen, Zhi-Zhong Chen, Guohui Lin*, Yao Xu, and An Zhang. Approximation algorithms for maximally balanced connected graph partition. Algorithmica. 83, 3715-3740, 2021.
[5] An Zhang, Yong Chen, Zhi-Zhong Chen, and Guohui Lin*. Improved approximation algorithms for path vertex covers in regular graphs. Algorithmica. 82, 3041-3064, 2020.