Yi Zhou

42 papers A* 7A 2C 2Journal 30Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A near-real-time reduction-based algorithm for coloring massive graphs.
Comput. Oper. Res.
Chenghao Zhu, Yi Zhou
2026 J jnl
Exact Clique Number Manipulation via Edge Interdiction.
CoRR
Yi Zhou, Haoyu Jiang, Chenghao Zhu, André Rossi
2026 J jnl
Fast exact algorithms for the maximum diversity problem.
Eur. J. Oper. Res.
Jinping Lei, Lu Liu, Mingyu Xiao, Yi Zhou
2026 J jnl
Graph downsizing: a fast heuristic for querying closely connected subgraphs.
J. Heuristics
Yiping Liu, Mengxiao Zhang, Jiamou Liu, Yi Zhou
2025 J jnl
A Reduction-Driven Local Search for the Generalized Independent Set Problem.
CoRR
Yiping Liu, Yi Zhou, Zhenxiang Xu, Mingyu Xiao, Jin-Kao Hao
2025 J jnl
An Efficient Large Neighborhood Search Algorithm for Multi-level Constellation Scheduling Problem.
J. Circuits Syst. Comput.
Shunwang Wang, Ming Sun, Xinyu Mao, Yi Zhou
2025 A conf
Efficient Branch-and-Bound for Submodular Function Maximization Under Knapsack Constraint.
ECAI
Yimin Hao, Yi Zhou, Chao Xu, Zhang-Hua Fu
2025 J jnl
Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint.
CoRR
Yimin Hao, Yi Zhou, Chao Xu, Zhang-Hua Fu
2025 J jnl
Efficient top-k s-biplexes search over large bipartite graphs with time complexity guarantees.
Expert Syst. Appl.
Zhenxiang Xu, Yiping Liu, Yi Zhou, Yimin Hao, Zhengren Wang
2024 A* conf
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem.
AAAI
Lu Liu, Mingyu Xiao, Yi Zhou
2024 J jnl
A Faster Branching Algorithm for the Maximum
CoRR
Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao
2024 A conf
A Faster Branching Algorithm for the Maximum k-Defective Clique Problem.
ECAI
Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao
2024 — conf
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs.
COCOON (2)
Ming Sun, Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu
2024 J jnl
Finding small feedback arc sets on large graphs.
Comput. Oper. Res.
Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
2023 A* conf
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap.
IJCAI
Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao
2023 J jnl
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap.
CoRR
Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao
2023 J jnl
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem.
Comput. Oper. Res.
Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao
2023 J jnl
Listing maximal
Inf. Sci.
Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü
2022 J jnl
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
IEEE Trans. Cybern.
Zhi Lu, Yi Zhou, Jin-Kao Hao
2022 J jnl
An effective branch-and-bound algorithm for the maximum s-bundle problem.
Eur. J. Oper. Res.
Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin
2022 C conf
Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions.
TAMC
Yi Zhou, Shan Hu, Zimo Sheng
2022 J jnl
Extracting Densest Sub-hypergraph with Convex Edge-weight Functions.
CoRR
Yi Zhou, Shan Hu, Zimo Sheng
2022 A* conf
Listing Maximal k-Plexes in Large Real-World Graphs.
WWW
Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
2022 J jnl
Listing Maximal k-Plexes in Large Real-World Graphs.
CoRR
Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
2022 J jnl
On fast enumeration of maximal cliques in large graphs.
Expert Syst. Appl.
Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou
2021 J jnl
Computing maximum
Comput. Oper. Res.
Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao
2021 A* conf
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set.
WWW
Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding
2021 A* conf
Enhancing Balanced Graph Edge Partition with Effective Local Search.
AAAI
Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
2021 A* conf
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding.
AAAI
Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu
2020 J jnl
Enhancing Balanced Graph Edge Partition with Effective Local Search.
CoRR
Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
2020 A* conf
Enumerating Maximal
AAAI
Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin
2020 C conf
The Complexity of the Partition Coloring Problem.
TAMC
Zhenyu Guo, Mingyu Xiao, Yi Zhou
2020 J jnl
The Complexity of the Partition Coloring Problem.
CoRR
Zhenyu Guo, Mingyu Xiao, Yi Zhou
2019 J jnl
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition.
Comput. Oper. Res.
Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo
2019 J jnl
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem.
Comput. Oper. Res.
Zhi Lu, Jin-Kao Hao, Yi Zhou
2019 J jnl
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs.
Eng. Appl. Artif. Intell.
Yi Zhou, Jin-Kao Hao
2018 J jnl
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs.
Eur. J. Oper. Res.
Yi Zhou, André Rossi, Jin-Kao Hao
2017 J jnl
Combining tabu search and graph reduction to solve the maximum balanced biclique problem.
CoRR
Yi Zhou, Jin-Kao Hao
2017 J jnl
Frequency-driven tabu search for the maximum s-plex problem.
Comput. Oper. Res.
Yi Zhou, Jin-Kao Hao
2017 J jnl
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem.
Eur. J. Oper. Res.
Yi Zhou, Jin-Kao Hao, Adrien Goëffon
2017 J jnl
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem.
CoRR
Yi Zhou, André Rossi, Jin-Kao Hao
2016 J jnl
A three-phased local search approach for the clique partitioning problem.
J. Comb. Optim.
Yi Zhou, Jin-Kao Hao, Adrien Goëffon