A three-phased local search approach for the clique partitioning problem. - Yi Zhou 016; Jin-Kao Hao; Adrien Goëffon (J. Comb. Optim., 2016)

Frequency-driven tabu search for the maximum s-plex problem. - Yi Zhou 016; Jin-Kao Hao (Comput. Oper. Res., 2017)

Combining tabu search and graph reduction to solve the maximum balanced biclique problem. - Yi Zhou 016; Jin-Kao Hao (CoRR, 2017)

Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem. - Yi Zhou 016; André Rossi; Jin-Kao Hao (CoRR, 2017)

PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem. - Yi Zhou 016; Jin-Kao Hao; Adrien Goëffon (Eur. J. Oper. Res., 2017)

Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs. - Yi Zhou 016; André Rossi; Jin-Kao Hao (Eur. J. Oper. Res., 2018)

Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. - Weibo Lin; Mingyu Xiao 001; Yi Zhou 016; Zhenyu Guo (Comput. Oper. Res., 2019)

Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. - Zhi Lu; Jin-Kao Hao; Yi Zhou 016 (Comput. Oper. Res., 2019)

Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs. - Yi Zhou 016; Jin-Kao Hao (Eng. Appl. Artif. Intell., 2019)

Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. - Yi Zhou 016; Jingwei Xu; Zhenyu Guo; Mingyu Xiao 001; Yan Jin 005 (AAAI, 2020)

The Complexity of the Partition Coloring Problem. - Zhenyu Guo; Mingyu Xiao 001; Yi Zhou 016 (TAMC, 2020)

Enhancing Balanced Graph Edge Partition with Effective Local Search. - Zhenyu Guo; Mingyu Xiao 001; Yi Zhou 016; Dongxiang Zhang; Kian-Lee Tan (AAAI, 2021)

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. - Yi Zhou 016; Shan Hu; Mingyu Xiao 001; Zhang-Hua Fu (AAAI, 2021)

Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. - Mingyu Xiao 001; Sen Huang; Yi Zhou 016; Bolin Ding (WWW, 2021)

Computing maximum k-defective cliques in massive graphs. - Xiaoyu Chen; Yi Zhou 016; Jin-Kao Hao; Mingyu Xiao 001 (Comput. Oper. Res., 2021)

Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions. - Yi Zhou 016; Shan Hu; Zimo Sheng (TAMC, 2022)

Listing Maximal k-Plexes in Large Real-World Graphs. - Zhengren Wang; Yi Zhou 016; Mingyu Xiao 001; Bakhadyr Khoussainov (WWW, 2022)

An effective branch-and-bound algorithm for the maximum s-bundle problem. - Yi Zhou 016; Weibo Lin; Jin-Kao Hao; Mingyu Xiao 001; Yan Jin 005 (Eur. J. Oper. Res., 2022)

On fast enumeration of maximal cliques in large graphs. - Yan Jin 005; Bowen Xiong; Kun He 001; Yangming Zhou; Yi Zhou 016 (Expert Syst. Appl., 2022)

A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. - Zhi Lu; Yi Zhou 016; Jin-Kao Hao (IEEE Trans. Cybern., 2022)

A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. - Zhengren Wang; Yi Zhou 016; Chunyu Luo; Mingyu Xiao 001 (IJCAI, 2023)

Listing maximal k-relaxed-vertex connected components from large graphs. - Shan Hu; Yi Zhou 016; Mingyu Xiao 001; Zhang-Hua Fu; Zhipeng Lü (Inf. Sci., 2023)

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. - Mengfan Ma; Ziyang Men; André Rossi; Yi Zhou 016; Mingyu Xiao 001 (Comput. Oper. Res., 2023)

A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. - Lu Liu; Mingyu Xiao 001; Yi Zhou 016 (AAAI, 2024)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs. - Ming Sun 011; Xinyu Wu; Yi Zhou 016; Jin-Kao Hao; Zhang-Hua Fu (COCOON (2), 2024)

A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. - Chunyu Luo; Yi Zhou 016; Zhengren Wang; Mingyu Xiao 001 (ECAI, 2024)

Finding small feedback arc sets on large graphs. - Ziliang Xiong; Yi Zhou 016; Mingyu Xiao 001; Bakhadyr Khoussainov (Comput. Oper. Res., 2024)

A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. - Chunyu Luo; Yi Zhou 016; Zhengren Wang; Mingyu Xiao 001 (CoRR, 2024)

Efficient top-k s-biplexes search over large bipartite graphs with time complexity guarantees. - Zhenxiang Xu; Yiping Liu; Yi Zhou 016; Yimin Hao; Zhengren Wang (Expert Syst. Appl., 2025)

An Efficient Large Neighborhood Search Algorithm for Multi-level Constellation Scheduling Problem. - Shunwang Wang; Ming Sun 011; Xinyu Mao; Yi Zhou 016 (J. Circuits Syst. Comput., 2025)

A Reduction-Driven Local Search for the Generalized Independent Set Problem. - Yiping Liu; Yi Zhou 016; Zhenxiang Xu; Mingyu Xiao 001; Jin-Kao Hao (CoRR, 2025)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint. - Yimin Hao; Yi Zhou 016; Chao Xu; Zhang-Hua Fu (CoRR, 2025)