| On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem CM Li, H Jiang, F Manyà Computers & Operations Research 84, 1-15, 2017 | 92 | 2017 |
| An exact algorithm for the maximum weight clique problem in large graphs H Jiang, CM Li, F Manya Proceedings of the AAAI conference on artificial intelligence 31 (1), 2017 | 84 | 2017 |
| A two-stage maxsat reasoning approach for the maximum weight clique problem H Jiang, CM Li, Y Liu, F Manya Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 41 | 2018 |
| Incremental upper bound for the maximum clique problem CM Li, Z Fang, H Jiang, K Xu INFORMS Journal on Computing 30 (1), 137-153, 2018 | 34 | 2018 |
| A learning based branch and bound for maximum common subgraph related problems Y Liu, CM Li, H Jiang, K He Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2392-2399, 2020 | 29 | 2020 |
| Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique CM Li, H Jiang, RC Xu Learning and Intelligent Optimization: 9th International Conference, LION 9 …, 2015 | 27 | 2015 |
| Combining efficient preprocessing and incremental MaxSAT reasoning for MaxClique in large graphs H Jiang, CM Li, F Manya ECAI 2016, 939-947, 2016 | 25 | 2016 |
| A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem. H Jiang, D Zhu, Z Xie, S Yao, ZH Fu IJCAI, 1689-1696, 2021 | 24 | 2021 |
| Solving longest common subsequence problems via a transformation to the maximum clique problem C Blum, M Djukanovic, A Santini, H Jiang, CM Li, F Manyà, GR Raidl Computers & Operations Research 125, 105089, 2021 | 24 | 2021 |
| A new upper bound for the maximum weight clique problem CM Li, Y Liu, H Jiang, F Manyà, Y Li European Journal of Operational Research 270 (1), 66-77, 2018 | 20 | 2018 |
| A refined upper bound and inprocessing for the maximum k-plex problem H Jiang, F Xu, Z Zheng, B Wang, W Zhou Proceedings of the Thirty-Second International Joint Conference on …, 2023 | 6 | 2023 |
| An exact algorithm for the minimum dominating set problem H Jiang, Z Zheng Proceedings of the Thirty-Second International Joint Conference on …, 2023 | 5 | 2023 |
| Hybrid learning with new value function for the maximum common subgraph problem Y Liu, J Zhao, CM Li, H Jiang, K He arXiv preprint arXiv:2208.08620, 2022 | 3 | 2022 |
| An effective variable neighborhood search with perturbation for location-routing problem H Jiang, C Lucet, L Devendeville, CM Li International Journal on Artificial Intelligence Tools 28 (07), 1950024, 2019 | 3 | 2019 |
| Hybrid learning with new value function for the maximum common induced subgraph problem Y Liu, J Zhao, CM Li, H Jiang, K He Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 4044-4051, 2023 | 2 | 2023 |
| An environment-aware and dynamic compression-based approach for edge computing service migration C Pu, H Xu, H Jiang, D Chen, P Han 2022 2nd International Conference on Consumer Electronics and Computer …, 2022 | 2 | 2022 |
| A learning based branch and bound for maximum common subgraph problems Y Liu, C Li, H Jiang, K He arXiv preprint arXiv:1905.05840, 2019 | 2 | 2019 |
| D-MelGAN: speech synthesis with specific voiceprint features D Chen, H Jiang, C Pu, S Yao International Conference on Statistics, Applied Mathematics, and Computing …, 2022 | 1 | 2022 |
| Parallel Bounded Search for the Maximum Clique Problem H Jiang, K Bai, HJ Liu, CM Li, F Manyà, ZH Fu Journal of Computer Science and Technology 38 (5), 1187-1202, 2023 | | 2023 |
| Continuous Spatial Public Goods Game Based on Particle Swarm Optimization with Memory Stability S Wang, Z Li, W Li, H Jiang Mathematics 10 (23), 4572, 2022 | | 2022 |
