default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi Zhou 0016
Person information
- affiliation: University of Electronic Science and Technology of China, School of Computer Science and Engineering, Chengdu, China
Other persons with the same name
- Yi Zhou — disambiguation page
- Yi Zhou 0001
![[0000-0001-5420-8016]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5420-8016")
— Chinese Academy of Sciences, Institute of Remote Sensing and Digital Earth, Beijing, China - Yi Zhou 0002 — Singapore Polytechnic,School of Electrical and Electronic Engineering, Singapore (and 1 more)
- Yi Zhou 0003 — Shanghai Jiao Tong University, Computer Science Department, China
- Yi Zhou 0004 — Henan University, School of Computer and Information Engineering, Kaifeng, China (and 1 more)
- Yi Zhou 0005 — Sun Yat-sen University, Zhongshan School of Medicine, Guangzhou, China
- Yi Zhou 0006 — Monash University, Department of Management, Caulfield East, VIC, Australia (and 1 more)
- Yi Zhou 0007 — Southeast University, Nanjing, Jiangsu, China (and 2 more)
- Yi Zhou 0008 — Fudan University, Shanghai Engineering Research Center of Ultra Precision Optical Manufacturing, Shanghai, China
- Yi Zhou 0009 — Columbus State University, GA, USA (and 1 more)
- Yi Zhou 0010 — Australian National University, Research School of Engineering, Canberra, ACT, Australia
- Yi Zhou 0011 — Dalian Maritime University, College of Information Science and Technology, China (and 1 more)
- Yi Zhou 0012 — Southwest Jiaotong University, Provincial Key Laboratory of Information Coding and Transmission, Chengdu, China (and 1 more)
- Yi Zhou 0013 — University of Western Sydney, School of Computing, Engineering and Mathematics, Australia
- Yi Zhou 0014 — Chongqing University of Posts and Telecommunications, School of Communication and Information Engineering, China (and 2 more)
- Yi Zhou 0015 — IBM Research - Almaden, San Jose, CA, USA
- Yi Zhou 0017 — University of Utah, Department of Electrical and Computer Engineering, Salt Lake City, UT, USA
- Yi Zhou 0018 — Bytedance AI Lab, China (and 1 more)
- Yi Zhou 0019 — University of Liverpool, UK
- Yi Zhou 0020 — National University of Singapore, Department of Electrical, and Computer Engineering, Singapore
- Yi Zhou 0021 — Hunan University, China (and 1 more)
- Yi Zhou 0022 — Wuhan University of Science and Technology, School of Information Science and Engineering, Engineering Research Center of Metallurgical Automation and Measurement Technology, China
- Yi Zhou 0023 — Adobe, USA (and 2 more)
- Yi Zhou 0024 — Soochow University, School of Electronics and Information Engineering, China
- Yi Zhou 0025 — Carnegie Mellon University, Pittsburgh, PA, USA
- Yi Zhou 0026 — University ofElectronic Science and Technology of China, School of Automation Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Finding small feedback arc sets on large graphs. Comput. Oper. Res. 169: 106724 (2024)- [c10]Lu Liu, Mingyu Xiao, Yi Zhou:
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. AAAI 2024: 20768-20776 - [c9]Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao:
A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. ECAI 2024: 4132-4139 - [i8]Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao:
A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. CoRR abs/2407.16588 (2024) - 2023
- [j13]Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao:
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. Comput. Oper. Res. 153: 106151 (2023) - [j12]Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü:
Listing maximal k-relaxed-vertex connected components from large graphs. Inf. Sci. 620: 67-83 (2023) - [c8]Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao:
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. IJCAI 2023: 5648-5656 - [i7]Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao:
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. CoRR abs/2306.13258 (2023) - 2022
- [j11]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): 27-39 (2022) - [j10]Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou:
On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187: 115915 (2022) - [j9]Zhi Lu, Yi Zhou, Jin-Kao Hao:
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. IEEE Trans. Cybern. 52(9): 9391-9403 (2022) - [c7]Yi Zhou, Shan Hu, Zimo Sheng:
Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions. TAMC 2022: 305-321 - [c6]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. WWW 2022: 1517-1527 - [i6]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. CoRR abs/2202.08737 (2022) - [i5]Yi Zhou, Shan Hu, Zimo Sheng:
Extracting Densest Sub-hypergraph with Convex Edge-weight Functions. CoRR abs/2207.08340 (2022) - 2021
- [j8]Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao:
Computing maximum k-defective cliques in massive graphs. Comput. Oper. Res. 127: 105131 (2021) - [c5]Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan:
Enhancing Balanced Graph Edge Partition with Effective Local Search. AAAI 2021: 12336-12343 - [c4]Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu:
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. AAAI 2021: 12453-12460 - [c3]Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding:
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. WWW 2021: 3930-3940 - 2020
- [c2]Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin:
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. AAAI 2020: 2442-2449 - [c1]Zhenyu Guo, Mingyu Xiao, Yi Zhou:
The Complexity of the Partition Coloring Problem. TAMC 2020: 390-401 - [i4]Zhenyu Guo, Mingyu Xiao, Yi Zhou:
The Complexity of the Partition Coloring Problem. CoRR abs/2007.14225 (2020) - [i3]Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan:
Enhancing Balanced Graph Edge Partition with Effective Local Search. CoRR abs/2012.09451 (2020)
2010 – 2019
- 2019
- [j7]Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo:
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. Comput. Oper. Res. 109: 263-272 (2019) - [j6]Zhi Lu, Jin-Kao Hao, Yi Zhou:
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. Comput. Oper. Res. 111: 43-57 (2019) - [j5]Yi Zhou, Jin-Kao Hao:
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs. Eng. Appl. Artif. Intell. 77: 86-97 (2019) - 2018
- [j4]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): 834-843 (2018) - 2017
- [j3]Yi Zhou, Jin-Kao Hao:
Frequency-driven tabu search for the maximum s-plex problem. Comput. Oper. Res. 86: 65-78 (2017) - [j2]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): 41-54 (2017) - [i2]Yi Zhou, André Rossi, Jin-Kao Hao:
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem. CoRR abs/1705.07338 (2017) - [i1]Yi Zhou, Jin-Kao Hao:
Combining tabu search and graph reduction to solve the maximum balanced biclique problem. CoRR abs/1705.07339 (2017) - 2016
- [j1]Yi Zhou, Jin-Kao Hao, Adrien Goëffon:
A three-phased local search approach for the clique partitioning problem. J. Comb. Optim. 32(2): 469-491 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
