On feasible and infeasible search for equitable graph coloring. - Wen Sun 005; Jin-Kao Hao; Xiangjing Lai; Qinghua Wu 002 (GECCO, 2017)

Adaptive feasible and infeasible tabu search for weighted vertex coloring. - Wen Sun 005; Jin-Kao Hao; Xiangjing Lai; Qinghua Wu 002 (Inf. Sci., 2018)

Heuristic Algorithms for Graph Coloring Problems. (Algorithmes heuristiques pour des problèmes de coloration de graphes). - Wen Sun 005 (2018)

Iterated backtrack removal search for finding k-vertex-critical subgraphs. - Wen Sun 005; Jin-Kao Hao; Alexandre Caminada (J. Heuristics, 2019)

Memetic search for the equitable coloring problem. - Wen Sun 005; Jin-Kao Hao; Wenyu Wang; Qinghua Wu 002 (Knowl. Based Syst., 2020)

A solution-driven multilevel approach for graph coloring. - Wen Sun 005; Jin-Kao Hao; Yuhao Zang; Xiangjing Lai (Appl. Soft Comput., 2021)

An adaptive memetic algorithm for the bidirectional loop layout problem. - Wen Sun 005; Jin-Kao Hao; Wenlong Li; Qinghua Wu 002 (Knowl. Based Syst., 2022)

Dynamic thresholding search for the feedback vertex set problem. - Wen Sun 005; Jin-Kao Hao; Zihao Wu; Wenlong Li; Qinghua Wu 002 (PeerJ Comput. Sci., 2023)

Learning-based multi-start iterated local search for the profit maximization set covering problem. - Wen Sun 005; Wenlong Li; Jin-Kao Hao; Qinghua Wu 002 (Inf. Sci., 2023)

A knowledge-based iterated local search for the weighted total domination problem. - Wen Sun 005; Chaofan Chen; Jin-Kao Hao; Wenlong Li; Qinghua Wu 002; Yuning Chen (Inf. Sci., 2024)