| Enumerating Maximal k-Plexes with Worst-case Time Guarantee Y Zhou, J Xu, Z Guo, M Xiao, Y Jin AAAI, 2020 | 47 | 2020 |
| Improving maximum k-plex solver via second-order reduction and graph color bounding Y Zhou, S Hu, M Xiao, ZH Fu Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12453 …, 2021 | 39 | 2021 |
| Frequency-driven tabu search for the maximum s-plex problem Y Zhou, JK Hao Computers & Operations Research 86, 65-78, 2017 | 32 | 2017 |
| PUSH: A generalized operator for the maximum vertex weight clique problem Y Zhou, JK Hao, A Goëffon European Journal of Operational Research 257 (1), 41-54, 2017 | 30 | 2017 |
| A three-phased local search approach for the clique partitioning problem Y Zhou, JK Hao, A Goëffon Journal of Combinatorial Optimization 32, 469-491, 2016 | 30 | 2016 |
| Listing maximal k-plexes in large real-world graphs Z Wang, Y Zhou, M Xiao, B Khoussainov Proceedings of the ACM Web Conference 2022, 1517-1527, 2022 | 29 | 2022 |
| Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs Y Zhou, A Rossi, JK Hao European Journal of Operational Research 269 (3), 834-843, 2018 | 25 | 2018 |
| Computing maximum k-defective cliques in massive graphs X Chen, Y Zhou, JK Hao, M Xiao Computers & Operations Research 127, 105131, 2021 | 23 | 2021 |
| On fast enumeration of maximal cliques in large graphs Y Jin, B Xiong, K He, Y Zhou, Y Zhou Expert Systems with Applications 187, 115915, 2022 | 21 | 2022 |
| Efficient reductions and a fast algorithm of maximum weighted independent set M Xiao, S Huang, Y Zhou, B Ding Proceedings of the Web Conference 2021, 3930-3940, 2021 | 20 | 2021 |
| Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem Z Lu, JK Hao, Y Zhou Computers & Operations Research 111, 43-57, 2019 | 16 | 2019 |
| Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs Y Zhou, JK Hao Engineering Applications of Artificial Intelligence 77, 86-97, 2019 | 14 | 2019 |
| A hybrid evolutionary algorithm for the clique partitioning problem Z Lu, Y Zhou, JK Hao IEEE Transactions on Cybernetics 52 (9), 9391-9403, 2021 | 12 | 2021 |
| Fast Maximum -Plex Algorithms Parameterized by Small Degeneracy Gaps Z Wang, Y Zhou, C Luo, M Xiao, JK Hao arXiv preprint arXiv:2306.13258, 2023 | 11 | 2023 |
| Combining tabu search and graph reduction to solve the maximum balanced biclique problem Y Zhou, JK Hao arXiv preprint arXiv:1705.07339, 2017 | 8 | 2017 |
| An effective branch-and-bound algorithm for the maximum s-bundle problem Y Zhou, W Lin, JK Hao, M Xiao, Y Jin European Journal of Operational Research 297 (1), 27-39, 2022 | 6 | 2022 |
| Enhancing Balanced Graph Edge Partition with Effective Local Search Z Guo, M Xiao, Y Zhou, D Zhang, KL Tan Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12336 …, 2021 | 6 | 2021 |
| Listing maximal k-relaxed-vertex connected components from large graphs S Hu, Y Zhou, M Xiao, ZH Fu, Z Lü Information Sciences 620, 67-83, 2023 | 3 | 2023 |
| The complexity of the partition coloring problem Z Guo, M Xiao, Y Zhou International Conference on Theory and Applications of Models of Computation …, 2020 | 3 | 2020 |
| Computing lower bounds for minimum sum coloring and optimum cost chromatic partition W Lin, M Xiao, Y Zhou, Z Guo Computers & Operations Research 109, 263-272, 2019 | 3 | 2019 |
Jin-Kao HaoProfessor of Computer Science, University of Angers, FranceVerified email at univ-angers.fr
