Follow
Yi Zhou
Title
Cited by
Cited by
Year
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
252017
A three-phased local search approach for the clique partitioning problem
Y Zhou, JK Hao, A Goëffon
Journal of Combinatorial Optimization 32 (2), 469-491, 2016
232016
Enumerating Maximal k-Plexes with Worst-case Time Guarantee
Y Zhou, J Xu, Z Guo, M Xiao, Y Jin
AAAI, 2020
192020
Frequency-driven tabu search for the maximum s-plex problem
Y Zhou, JK Hao
Computers & Operations Research 86, 65-78, 2017
182017
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
172018
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
112019
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
92019
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
62021
Combining tabu search and graph reduction to solve the maximum balanced biclique problem
Y Zhou, JK Hao
arXiv preprint arXiv:1705.07339, 2017
62017
A hybrid evolutionary algorithm for the clique partitioning problem
Z Lu, Y Zhou, JK Hao
IEEE Transactions on Cybernetics, 2021
52021
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
42021
Computing maximum k-defective cliques in massive graphs
X Chen, Y Zhou, JK Hao, M Xiao
Computers & Operations Research 127, 105131, 2021
32021
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
32019
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
22021
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
12022
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
12022
The complexity of the partition coloring problem
Z Guo, M Xiao, Y Zhou
International Conference on Theory and Applications of Models of Computation …, 2020
12020
AUToSAR 符合性测试适配器的实现方法
周毅, 张晓先, 陈丽蓉
计算机工程 40 (1), 291-294, 2014
12014
Extracting Densest Sub-hypergraph with Convex Edge-weight Functions
Y Zhou, S Hu, Z Sheng
arXiv preprint arXiv:2207.08340, 2022
2022
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
2022
The system can't perform the operation now. Try again later.
Articles 1–20