Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs. - Suogang Gao; Jun Guo 004; Wen Liu 009 (Eur. J. Comb., 2007)

Some Properties of Macula's matrix and its complement. - Wen Liu 009; Yafan Yue; Suogang Gao (Ars Comb., 2009)

An approximation algorithm for submodular hitting set problem with linear penalties. - Shaojing Du; Suogang Gao; Bo Hou; Wen Liu 009 (J. Comb. Optim., 2020)

An approximation algorithm for the k-prize-collecting multicut on a tree problem. - Xin Hou; Wen Liu 009; Bo Hou (Theor. Comput. Sci., 2020)

A greedy algorithm for the fault-tolerant outer-connected dominating set problem. - Xiaozhi Wang; Xianyue Li; Bo Hou; Wen Liu 009; Lidong Wu; Suogang Gao (J. Comb. Optim., 2021)

A new fuzzy multi-attribute group decision-making method with generalized maximal consistent block and its application in emergency management. - Yan Sun; Jusheng Mi; Jinkun Chen; Wen Liu 009 (Knowl. Based Syst., 2021)

An approximation algorithm for the k-generalized Steiner forest problem. - Jiawen Gao; Suogang Gao; Wen Liu 009; Weili Wu 001; Ding-Zhu Du; Bo Hou (Optim. Lett., 2021)

An approximation algorithm for the submodular multicut problem in trees with linear penalties. - Chenfei Hou; Suogang Gao; Wen Liu 009; Weili Wu 001; Ding-Zhu Du; Bo Hou (Optim. Lett., 2021)

Single axiomatic characterization of a hesitant fuzzy generalization of rough approximation operators. - Wen Liu 009; Ju-Sheng Mi; Yan Sun (Soft Comput., 2021)

On approximation algorithm for the edge metric dimension problem. - Yufei Huang 010; Bo Hou; Wen Liu 009; Lidong Wu; Stephen B. Rainwater; Suogang Gao (Theor. Comput. Sci., 2021)

Approximation algorithms for the submodular edge cover problem with submodular penalties. - Xin Wang; Suogang Gao; Bo Hou; Lidong Wu; Wen Liu 009 (Theor. Comput. Sci., 2021)

Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP. - Bo Hou; Zhenzhen Pang; Suogang Gao; Wen Liu 009 (AAIM, 2022)

Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. - Hongye Zheng; Suogang Gao; Wen Liu 009; Weili Wu 001; Ding-Zhu Du; Bo Hou (J. Comb. Optim., 2022)

An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties. - Jiaxuan Zhang; Suogang Gao; Bo Hou; Wen Liu 009 (Comput. Appl. Math., 2022)

An approximation algorithm for the clustered path travelling salesman problem. - Jiaxuan Zhang; Suogang Gao; Bo Hou; Wen Liu 009 (J. Comb. Optim., 2023)

An Approximation Algorithm for the (Metric) Clustered Path Traveling Salesman Problem. - Jiaxuan Zhang; Suogang Gao; Bo Hou; Wen Liu 009 (COCOA (2), 2024)

Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. - Bo Hou; Hongye Zheng; Wen Liu 009; Weili Wu 001; Ding-Zhu Du; Suogang Gao (Optim. Lett., 2024)

W-prize-collecting scheduling problem on parallel machines. - Bo Hou; Tianjiao Guo; Suogang Gao; Guanghua Wang; Weili Wu 001; Wen Liu 009 (J. Comb. Optim., 2024)

An approximation algorithm for the k-prize-collecting hitting set problem. - Qin Liu; Bo Hou; Gengsheng Zhang; Wen Liu 009 (Optim. Lett., 2025)

Approximation algorithms for the partition set cover problem with penalties. - Qi Wang; Bo Hou; Gengsheng Zhang; Yisheng Zhou; Wen Liu 009 (J. Comb. Optim., 2025)