| 2025 | TAMC | On the Windy k-Traveling Salesman Problem. | Jianping Li, Xiaoxiao Yang, Junran Lichen, Wei Li, Runtao Xie, Ping Yang |
| 2024 | AAIM | Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty. | Guojun Hu, Pengxiang Pan, Junran Lichen, Lijian Cai |
| 2024 | COCOA | On the Constrained Steiner Strong Connectivity Augmentation Problem. | Junran Lichen, Shuwen Ge, Runtao Xie, Ping Yang |
| 2024 | COCOA | On the Min-max Heterogeneous Weighted Delivery Problem. | Jianping Li, Ping Yang, Junran Lichen |
| 2023 | COCOA | An Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem. | Jianping Li, Suding Liu, Junran Lichen |
| 2023 | COCOON | The Heterogeneous Rooted Tree Cover Problem. | Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li |
| 2022 | AAIM | The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. | Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang |
| 2021 | AAIM | An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem. | Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu |
| 2021 | COCOA | Cycle-Connected Mixed Graphs and Related Problems. | Junran Lichen |
| 2021 | COCOA | Delay-Constrained Minimum Shortest Path Trees and Related Problems. | Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang |
| 2020 | AAIM | On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ | Junran Lichen, Jianping Li, Wencheng Wang, Jean Yeh, Yeong-Nan Yeh, Xingxing Yu, Yujie Zheng |
| 2019 | AAIM | On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. | Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu |
| 2017 | COCOA | Approximation Algorithms for the Generalized Stacker Crane Problem. | Jianping Li, Xiaofei Liu, Weidong Li, Li Guan, Junran Lichen |