default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuangzhou Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Xiaodong Niu, Guangzhou Chen
, Qiang Gao, Shanqi Pang:
New results on asymmetric orthogonal arrays with strength t ≥ 3. Discret. Math. 348(2): 114264 (2025)- 2023
- [j17]Guangzhou Chen, Xiaotong Zhang:
Constructions of irredundant orthogonal arrays. Adv. Math. Commun. 17(6): 1314-1337 (2023) - [j16]Guangzhou Chen, Xiaodong Niu:
Constructions for new orthogonal arrays based on large sets of orthogonal arrays. Des. Codes Cryptogr. 91(7): 2605-2625 (2023) - [j15]Guangzhou Chen, Wen Li, Kejun Chen, Ming Zhong:
The existence spectrum for regular sparse anti-magic squares. Discret. Math. 346(10): 113531 (2023) - 2022
- [j14]Yajuan Zang, Guangzhou Chen, Kejun Chen, Zihong Tian:
Further results on 2-uniform states arising from irredundant orthogonal arrays. Adv. Math. Commun. 16(2): 231-247 (2022) - [j13]Xiao Zhang, Shanqi Pang, Guangzhou Chen:
Construction of orthogonal arrays of strength three by augmented difference schemes. Discret. Math. 345(11): 113041 (2022) - [j12]Guangzhou Chen, Wen Li, Ming Zhong, Bangying Xin:
On the Existence of Regular Sparse Anti-magic Squares of Odd Order. Graphs Comb. 38(2): 47 (2022) - 2021
- [j11]Fengchu Pan, Wen Li, Guangzhou Chen, Bangying Xin:
A complete solution to the existence of normal bimagic squares of even order. Discret. Math. 344(4): 112292 (2021) - [j10]Guangzhou Chen, Kejun Chen, Yong Zhang, Ning Jiang:
Super-simple group divisible designs with block size 4 and index λ = 7, 8. Discret. Math. 344(12): 112592 (2021) - [j9]Guangzhou Chen, Xiaotong Zhang, Yue Guo:
New results for 2-uniform states based on irredundant orthogonal arrays. Quantum Inf. Process. 20(1): 43 (2021)
2010 – 2019
- 2019
- [j8]Guangzhou Chen, Ce Shi, Yue Guo:
Ideal ramp schemes and augmented orthogonal arrays. Discret. Math. 342(2): 405-411 (2019) - 2018
- [j7]Guangzhou Chen, Yue Guo, Yong Zhang:
Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4. Adv. Math. Commun. 12(2): 351-362 (2018) - 2017
- [j6]Guangzhou Chen, Yong Zhang, Kejun Chen:
Super-simple pairwise balanced designs with block sizes 3 and 4. Discret. Math. 340(2): 236-242 (2017) - 2016
- [j5]Kejun Chen, Wen Li, Guangzhou Chen, Ruizhong Wei:
Regular sparse anti-magic squares with maximum density. Ars Comb. 127: 167-183 (2016) - [j4]Guangzhou Chen, Haiyan Chen, Kejun Chen, Wen Li:
Regular sparse anti-magic squares with small odd densities. Discret. Math. 339(1): 138-156 (2016) - [j3]Shanqi Pang, Yajuan Wang, Guangzhou Chen, Jiao Du:
The Existence of a Class of Mixed Orthogonal Arrays. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(4): 863-868 (2016) - [j2]Guangzhou Chen, Jiaquan Wang, Ruzhong Li:
Parameter identification for a water quality model using two hybrid swarm intelligence algorithms. Soft Comput. 20(7): 2829-2839 (2016) - 2013
- [j1]Kejun Chen, Guangzhou Chen, Wen Li, Ruizhong Wei:
Super-simple balanced incomplete block designs with block size 5 and index 3. Discret. Appl. Math. 161(16-17): 2396-2404 (2013) - [c2]Guangzhou Chen, Jiaquan Wang, Chuanjun Li:
Investment Risk Evaluation of High-Tech Projects Based on Random Forests Model. BIC-TA 2013: 733-741 - 2011
- [c1]Guangzhou Chen, Jiaquan Wang, Ruzhong Li:
Identification of Parameters in Chemical Kinetics Using a Hybrid Algorithm of Artificial Bee Colony Algorithm and Simplex. AICI (3) 2011: 220-227
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-10-04 20:05 CEST 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:
