Yi Zhou

According to our database, Yi Zhou authored at least 22 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem.

Lu Liu, Mingyu Xiao, Yi Zhou

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem.

Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao

Comput. Oper. Res., May, 2023

Listing maximal <i>k</i>-relaxed-vertex connected components from large graphs.

Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü

Inf. Sci., 2023

A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap.

Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.

Zhi Lu, Yi Zhou, Jin-Kao Hao

IEEE Trans. Cybern., 2022

On fast enumeration of maximal cliques in large graphs.

Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou

Expert Syst. Appl., 2022

An effective branch-and-bound algorithm for the maximum s-bundle problem.

Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin

Eur. J. Oper. Res., 2022

Listing Maximal k-Plexes in Large Real-World Graphs.

Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions.

Yi Zhou, Shan Hu, Zimo Sheng

Proceedings of the Theory and Applications of Models of Computation, 2022

2021

Computing maximum <i>k</i>-defective cliques in massive graphs.

Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao

Comput. Oper. Res., 2021

Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set.

Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding

Proceedings of the WWW '21: The Web Conference 2021, 2021

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding.

Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Enhancing Balanced Graph Edge Partition with Effective Local Search.

Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The Complexity of the Partition Coloring Problem.

Zhenyu Guo, Mingyu Xiao, Yi Zhou

Proceedings of the Theory and Applications of Models of Computation, 2020

Enumerating Maximal <i>k</i>-Plexes with Worst-Case Time Guarantee.

Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs.

Yi Zhou, Jin-Kao Hao

Eng. Appl. Artif. Intell., 2019

Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem.

Zhi Lu, Jin-Kao Hao, Yi Zhou

Comput. Oper. Res., 2019

Computing lower bounds for minimum sum coloring and optimum cost chromatic partition.

Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo

Comput. Oper. Res., 2019

2018

Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs.

Yi Zhou, André Rossi, Jin-Kao Hao

Eur. J. Oper. Res., 2018

2017

PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem.

Yi Zhou, Jin-Kao Hao, Adrien Goëffon

Eur. J. Oper. Res., 2017

Frequency-driven tabu search for the maximum s-plex problem.

Yi Zhou, Jin-Kao Hao

Comput. Oper. Res., 2017

2016

A three-phased local search approach for the clique partitioning problem.

Yi Zhou, Jin-Kao Hao, Adrien Goëffon

J. Comb. Optim., 2016