Yi Zhou
Orcid: 0000-0002-9023-4374Affiliations:
- University of Electronic Science and Technology of China, School of Computer Science and Engineering, Chengdu, China
According to our database1,
Yi Zhou
authored at least 27 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
2
2
3
1
3
1
4
1
2
1
2
3
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem.
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.
Comput. Oper. Res., May, 2023
Inf. Sci., 2023
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
2022
IEEE Trans. Cybern., 2022
Eur. J. Oper. Res., 2022
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022
Proceedings of the Theory and Applications of Models of Computation, 2022
2021
Comput. Oper. Res., 2021
Proceedings of the WWW '21: The Web Conference 2021, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Proceedings of the Theory and Applications of Models of Computation, 2020
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.
Eng. Appl. Artif. Intell., 2019
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem.
Comput. Oper. Res., 2019
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition.
Comput. Oper. Res., 2019
2018
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs.
Eur. J. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
CoRR, 2017
Combining tabu search and graph reduction to solve the maximum balanced biclique problem.
CoRR, 2017
Comput. Oper. Res., 2017
2016
J. Comb. Optim., 2016