| Two efficient local search algorithms for maximum weight clique problem Y Wang, S Cai, M Yin Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 112 | 2016 |
| Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function Y Wang, S Cai, M Yin Journal of Artificial Intelligence Research 58, 267-295, 2017 | 59 | 2017 |
| A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity Y Wang, D Ouyang, L Zhang, M Yin Science China. Information Sciences 60 (6), 062103, 2017 | 55 | 2017 |
| 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 | 47 | 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 |
| NuMWVC: A novel local search for minimum weighted vertex cover problem R Li, S Hu, S Cai, J Gao, Y Wang, M Yin Journal of the Operational Research Society 71 (9), 1498-1509, 2020 | 35 | 2020 |
| A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem R Li, S Hu, Y Wang, M Yin Neural Computing and Applications 28, 1775-1785, 2017 | 34 | 2017 |
| New heuristic approaches for maximum balanced biclique problem Y Wang, S Cai, M Yin Information Sciences 432, 362-375, 2018 | 33 | 2018 |
| A path cost-based GRASP for minimum independent dominating set problem Y Wang, R Li, Y Zhou, M Yin Neural Computing and Applications 28, 143-151, 2017 | 33 | 2017 |
| GRASP for connected dominating set problems R Li, S Hu, J Gao, Y Zhou, Y Wang, M Yin Neural Computing and Applications 28, 1059-1067, 2017 | 30 | 2017 |
| A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem Y Wang, M Yin, D Ouyang, L Zhang International Transactions in Operational Research 24 (6), 1463-1485, 2017 | 30 | 2017 |
| Reduction and local search for weighted graph coloring problem Y Wang, S Cai, S Pan, X Li, M Yin Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2433-2441, 2020 | 29 | 2020 |
| Two-goal local search and inference rules for minimum dominating set S Cai, W Hou, Y Wang, C Luo, Q Lin Proceedings of the Twenty-Ninth International Conference on International …, 2021 | 19 | 2021 |
| A local search algorithm with reinforcement learning based repair procedure for minimum weight independent dominating set Y Wang, S Pan, C Li, M Yin Information Sciences 512, 533-548, 2020 | 19 | 2020 |
| A memetic algorithm for minimum independent dominating set problem Y Wang, J Chen, H Sun, M Yin Neural Computing and Applications 30 (8), 2519-2529, 2018 | 17 | 2018 |
| A novel hybrid algorithm for minimum total dominating set problem F Yuan, C Li, X Gao, M Yin, Y Wang Mathematics 7 (3), 222, 2019 | 15 | 2019 |
| Combining max–min ant system with effective local search for solving the maximum set k-covering problem Y Zhou, X Liu, S Hu, Y Wang, M Yin Knowledge-Based Systems 239, 108000, 2022 | 13 | 2022 |
| An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem S Pan, Y Ma, Y Wang, Z Zhou, J Ji, M Yin, S Hu Frontiers of Computer Science 17 (4), 174326, 2023 | 12 | 2023 |
| Nucds: An efficient local search algorithm for minimum connected dominating set B Li, X Zhang, S Cai, J Lin, Y Wang, C Blum Proceedings of the Twenty-Ninth International Conference on International …, 2021 | 12 | 2021 |
Minghao Yin (殷明浩)Professor of Computer Science, Northeast Normal UniversityVerified email at nenu.edu.cn
