Skip to content

Research

Publications

  1. Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao: A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI) 2023, Macau.

  2. Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao: A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. Computers and Operations Research 153: 106151 (2023)PDF(full version).

  3. Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü. Listing maximal k-relaxed-vertex connected components from large graphs. Inf. Sci. 620: 67-83 (2023) PDF(full version)

  4. Yi Zhou, Shan Hu, Zimo Sheng, Extracting Densest Sub-hypergraph with Convex Edge-weight Functions. International Conference on Theory and Applications of Models of Computation (TAMC) 2022. PDF(full version)

  5. Zhengren Wang, Yi Zhou*, Mingyu Xiao, Bakhadyr Khoussainov. Listing Maximal k-Plexes in Large Real-World Graphs. The Web Conference 2022 PDF. CODE

  6. Yi Zhou, Weibo Lin, Jin-Kao Hao*, Mingyu Xiao, Yan Jin. An effective branch-and-bound algorithm for the maximum s-bundle problem. European Journal of Operational Research. May 2021. PDF , CODE

  7. Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding. Efficient Reductions and A Fast Algorithm of Maximum Weighted Independent Set. The Web Conference 2021 conference. PDF，Video

  8. Zhi Lu, Yi Zhou*, Jin-Kao Hao*. A hybrid evolutionary algorithm for the Clique Partitioning Problem. IEEE Transactions on Cybernetics*. PDF

  9. Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan. Enhancing Balanced Graph Edge Partition with Effective Local Search. The 35th AAAI Conference on Artificial Intelligence, 2021. PDF

  10. Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu. Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. The 35th AAAI Conference on Artificial Intelligence, 2021. PDF

  11. Xiaoyu Chen, Yi Zhou*, Jin-Kao Hao, Mingyu Xiao. Computing maximum k-defective cliques in massive graphs. Computers and Operations Research. 127, 2021. PDF, CODE

  12. Zhengyu Guo, Mingyu Xiao, Yi Zhou . The Complexity of the Partition Coloring Problem. International Conference on Theory and Applications of Models of Computation (TAMC). LNCS, vol 12337. Springer. pp.390-401, 2020. PDF

  13. Yi Zhou, Jingwei Xu, Zhengyu Guo, Mingyu Xiao, Y Jin. Enumerating maximal k-plexes with worst-case time guarantee. The 34th AAAI Conference on Artificial Intelligence, New York. Feb. 2020. PDF

  14. Weibo Lin, Mingyu Xiao, Yi Zhou, Zhengyu Guo. Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. Computers & Operations Research 109, 263-272. 2019. PDF

  15. Zhi Lu, Jin-Kao Hao, Yi Zhou. Stagnation-aware Breakout Tabu Search for the Minimum Conductance Graph Partitioning Problem. Computers & Operations Research 111, 43-57. 2019. PDF

  16. Yi Zhou, Jin-Kao Hao. Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs. Engineering Applications of Artificial Intelligence 77, 86-97. 2019. PDF

  17. Yi Zhou, André Rossi, Jin-Kao Hao. Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs. European Journal of Operational Research 269 (3), 834-843. 2018. PDF

  18. Yi Zhou, Jin-Kao Hao. Frequency-driven tabu search for the maximum s-plex problem. Computers & Operations Research 86, 65-78. 2017 PDF CODE

  19. Yi Zhou, Jin-Kao Hao, Adrien Goëffon. PUSH: A generalized operator for the maximum vertex weight clique problem. European Journal of Operational Research 257 (1), 41-54. 2017 PDF

  20. Yi Zhou, Jin-Kao Hao, Adrien Goëffon. A three-phased local search approach for the clique partitioning problem. Journal of Combinatorial Optimization 32 (2), 469-491. 2016 PDF

Talks

  1. Finding Large Relaxed Cliques: Theory and Practice. School of Management, Northwestern Polytechnical University, June 2022.
  2. Fast exact algorithms for maximum relaxed clique problems. Seminar of Operations Research Society of China. Shandon, May. 2019
  3. L’opérateur PUSH pour la résolution approchée du problème de la clique de poids maximum. ROADEF, Metz, France, 2017

Grants

  1. National Natural Science Foundation of China (2024-2027)
  2. CCF-Huawei Populus Grove Fund. (2023)
  3. National Natural Science Foundation of China (Young Scientists Fund 2018-2021)
  4. UESTC Initial Research Fund. 2018-2020
  5. The algorithm engineering course project (A teaching fund supported by Alibaba group).

Reviewing Services

  • Conferences: AAAI 2022, CIKM 2021-2023, WWW 2022, WSDM 2022
  • Journals: European Journal of Operational Research, Computers & Operations Research, Journal of Artificial Intelligence Research.