Yi Zhou

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 26

Top Topics

Bipartite Graph

Independent Set

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Lu Liu, Mingyu Xiao, Yi Zhou
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. AAAI (2024)
Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
Finding small feedback arc sets on large graphs. Comput. Oper. Res. 169 (2024)
Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao
-Defective Clique Problem. CoRR (2024)
Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü
-relaxed-vertex connected components from large graphs. Inf. Sci. 620 (2023)
Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin
An effective branch-and-bound algorithm for the maximum s-bundle problem. Eur. J. Oper. Res. 297 (1) (2022)
Zhi Lu, Yi Zhou, Jin-Kao Hao
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. IEEE Trans. Cybern. 52 (9) (2022)
Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs. CoRR (2022)
Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou
On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187 (2022)
Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
Listing Maximal k-Plexes in Large Real-World Graphs. WWW (2022)
Yi Zhou, Shan Hu, Zimo Sheng
Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions. TAMC (2022)
Yi Zhou, Shan Hu, Zimo Sheng
Extracting Densest Sub-hypergraph with Convex Edge-weight Functions. CoRR (2022)
Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao
-defective cliques in massive graphs. Comput. Oper. Res. 127 (2021)
Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
Enhancing Balanced Graph Edge Partition with Effective Local Search. AAAI (2021)
Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. AAAI (2021)
Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. WWW (2021)
Zhenyu Guo, Mingyu Xiao, Yi Zhou
The Complexity of the Partition Coloring Problem. TAMC (2020)
Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin
-Plexes with Worst-Case Time Guarantee. AAAI (2020)
Zhenyu Guo, Mingyu Xiao, Yi Zhou
The Complexity of the Partition Coloring Problem. CoRR (2020)
Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
Enhancing Balanced Graph Edge Partition with Effective Local Search. CoRR (2020)
Yi Zhou, Jin-Kao Hao
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs. Eng. Appl. Artif. Intell. 77 (2019)
Zhi Lu, Jin-Kao Hao, Yi Zhou
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. Comput. Oper. Res. 111 (2019)
Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. Comput. Oper. Res. 109 (2019)
Yi Zhou, André Rossi, Jin-Kao Hao
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs. Eur. J. Oper. Res. 269 (3) (2018)
Yi Zhou, Jin-Kao Hao
Frequency-driven tabu search for the maximum s-plex problem. Comput. Oper. Res. 86 (2017)
Yi Zhou, Jin-Kao Hao, Adrien Goëffon
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem. Eur. J. Oper. Res. 257 (1) (2017)
Yi Zhou, Jin-Kao Hao, Adrien Goëffon
A three-phased local search approach for the clique partitioning problem. J. Comb. Optim. 32 (2) (2016)