Yi Zhou

Orcid: 0000-0002-9023-4374

Affiliations:
  • 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:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

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
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Faster Branching Algorithm for the Maximum <i>k</i>-Defective Clique Problem.
CoRR, 2024

Finding small feedback arc sets on large graphs.
Comput. Oper. Res., 2024

A Faster Branching Algorithm for the Maximum k-Defective Clique Problem.
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

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

A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
IEEE Trans. Cybern., 2022

On fast enumeration of maximal cliques in large graphs.
Expert Syst. Appl., 2022

An effective branch-and-bound algorithm for the maximum s-bundle problem.
Eur. J. Oper. Res., 2022

Listing Maximal k-Plexes in Large Real-World Graphs.
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.
Proceedings of the Theory and Applications of Models of Computation, 2022

2021
Computing maximum <i>k</i>-defective cliques in massive graphs.
Comput. Oper. Res., 2021

Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Enhancing Balanced Graph Edge Partition with Effective Local Search.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The Complexity of the Partition Coloring Problem.
Proceedings of the Theory and Applications of Models of Computation, 2020

Enumerating Maximal <i>k</i>-Plexes with Worst-Case Time Guarantee.
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
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem.
Eur. J. Oper. Res., 2017

Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem.
CoRR, 2017

Combining tabu search and graph reduction to solve the maximum balanced biclique problem.
CoRR, 2017

Frequency-driven tabu search for the maximum s-plex problem.
Comput. Oper. Res., 2017

2016
A three-phased local search approach for the clique partitioning problem.
J. Comb. Optim., 2016


  Loading...