| A fast local search algorithm for minimum weight dominating set problem on massive graphs. Y Wang, S Cai, J Chen, M Yin IJCAI, 1514-1522, 2018 | 51 | 2018 |
| SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem Y Wang, S Cai, J Chen, M Yin Artificial Intelligence 280, 103230, 2020 | 48 | 2020 |
| An exact algorithm for maximum k-plexes in massive graphs. J Gao, J Chen, M Yin, R Chen, Y Wang IJCAI, 1449-1455, 2018 | 40 | 2018 |
| A memetic algorithm for minimum independent dominating set problem Y Wang, J Chen, H Sun, M Yin Neural Computing and Applications 30, 2519-2529, 2018 | 17 | 2018 |
| Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism J Chen, S Cai, Y Wang, W Xu, J Ji, M Yin Artificial Intelligence 314, 103819, 2023 | 9 | 2023 |
| NuQClq: An effective local search algorithm for maximum quasi-clique problem J Chen, S Cai, S Pan, Y Wang, Q Lin, M Zhao, M Yin Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12258 …, 2021 | 8 | 2021 |
| MLQCC: an improved local search algorithm for the set k‐covering problem Y Wang, C Li, H Sun, J Chen, M Yin International Transactions in Operational Research 26 (3), 856-887, 2019 | 8 | 2019 |
| NukCP: An improved local search algorithm for maximum k-club problem J Chen, Y Wang, S Cai, M Yin, Y Zhou, J Wu Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 10146 …, 2022 | 2 | 2022 |
