An Exact Algorithm for Maximum k-Plexes in Massive Graphs. - Jian Gao 007; Jiejiang Chen; Minghao Yin; Rong Chen 003; Yiyuan Wang 002 (IJCAI, 2018)

A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs. - Yiyuan Wang 002; Shaowei Cai 001; Jiejiang Chen; Minghao Yin (IJCAI, 2018)

A memetic algorithm for minimum independent dominating set problem. - Yiyuan Wang 002; Jiejiang Chen; Huanyao Sun; Minghao Yin (Neural Comput. Appl., 2018)

MLQCC: an improved local search algorithm for the set k-covering problem. - Yiyuan Wang 002; Chenxi Li; Huanyao Sun; Jiejiang Chen; Minghao Yin (Int. Trans. Oper. Res., 2019)

SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem. - Yiyuan Wang 002; Shaowei Cai 001; Jiejiang Chen; Minghao Yin (Artif. Intell., 2020)

NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem. - Jiejiang Chen; Shaowei Cai 001; Shiwei Pan; Yiyuan Wang 002; Qingwei Lin; Mengyu Zhao; Minghao Yin (AAAI, 2021)

NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem. - Jiejiang Chen; Yiyuan Wang 002; Shaowei Cai 001; Minghao Yin; Yupeng Zhou; Jieyu Wu (AAAI, 2022)

Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism. - Jiejiang Chen; Shaowei Cai 001; Yiyuan Wang 002; Wenhao Xu; Jia Ji; Minghao Yin (Artif. Intell., 2023)