default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChenyang Zhou 0001
Person information
- affiliation: Arizona State University, School of Computing, Informatics, and. Decision Systems Engineering, Tempe, AZ, USA
Other persons with the same name
- Chenyang Zhou — disambiguation page
- Chenyang Zhou 0002 — Karlsruhe Institute of Technology, Karlsruhe, Germany (and 1 more)
- Chenyang Zhou 0003
![[0000-0003-2485-1945]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-2485-1945")
— Minzu University of China (MUC), School of Chinese Minority Languages and Literature, Beijing, China - Chenyang Zhou 0004 — Shanghai University, School of Computer Engineering and Science, Shanghai, China
- Chenyang Zhou 0005 — Jiangling Motors Co. Ltd., Nanchang, China
- Chenyang Zhou 0006 — Northwest Normal University, College of Computer Science and Engineering, Lanzhou, Gansu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Anna L. D. Latour, Arunabha Sen, Kaustav Basu, Chenyang Zhou, Kuldeep S. Meel:
The Cardinality of Identifying Code Sets for Soccer Ball Graph with Application to Remote Sensing. CoRR abs/2407.14120 (2024)- 2020
- [c16]Arunaba Sen, Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Krzysztof Walkowiak:
On the Number of Steiner Trees in a Graph. DRCN 2020: 1-5
2010 – 2019
- 2019
- [b1]Chenyang Zhou:
Design, Analysis and Computation in Wireless and Optical Networks. Arizona State University, Tempe, USA, 2019 - [j3]Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matin-Moghaddam, Saharnaz Mehrani, Arunabha Sen:
Relay node placement under budget constraint. Pervasive Mob. Comput. 53: 1-12 (2019) - [c15]Arunabha Sen, Victoria Horan Goliber, Kaustav Basu, Chenyang Zhou, Sumitava Ghosh:
On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. ICDCN 2019: 307-316 - [i5]Kaustav Basu, Chenyang Zhou, Arunabha Sen, Victoria Horan Goliber:
A Novel Graph Analytic Approach to Monitor Terrorist Networks. CoRR abs/1902.02836 (2019) - 2018
- [c14]Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matin-Moghaddam, Saharnaz Mehrani, Arunabha Sen:
Relay Node Placement Under Budget Constraint. ICDCN 2018: 35:1-35:11 - [c13]Kaustav Basu, Chenyang Zhou, Arunabha Sen, Victoria Horan Goliber:
A Novel Graph Analytic Approach to Monitor Terrorist Networks. ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018: 1159-1166 - [c12]Arunabha Sen, Victoria Horan Goliber, Chenyang Zhou, Kaustav Basu:
Terrorist Network Monitoring with Identifying Code. SBP-BRiMS 2018: 329-339 - 2017
- [i4]Joydeep Banerjee, Chenyang Zhou, Arunabha Sen:
On Targeted Entity Hardening Problem in Multi-layered Interdependent Networks. CoRR abs/1701.07106 (2017) - [i3]Joydeep Banerjee, Chenyang Zhou, Arunabha Sen:
On Robustness in Multilayer Interdependent Network. CoRR abs/1702.01018 (2017) - [i2]Joydeep Banerjee, Arunabha Sen, Chenyang Zhou:
On Auxiliary Entity Allocation Problem in Multi-layered Interdependent Critical Infrastructures. CoRR abs/1703.06744 (2017) - 2016
- [c11]Joydeep Banerjee, Arunabha Sen, Chenyang Zhou:
On Auxiliary Entity Allocation Problem in Multi-layered Interdependent Critical Infrastructures. CRITIS 2016: 25-37 - [c10]Anisha Mazumder, Chenyang Zhou, Arun Das, Arunabha Sen:
Budget constrained relay node placement problem for maximal "connectedness". MILCOM 2016: 849-854 - [c9]Arunabha Sen, Arun Das, Chenyang Zhou, Anisha Mazumder, Nathalie Mitton, Abdoul Aziz Mbacké:
Reader scheduling for tag access in RFID systems. NOF 2016: 1-5 - 2015
- [j2]Arunabha Sen, Anisha Mazumder, Sujogya Banerjee, Arun Das, Chenyang Zhou, Shahrzad Shirazipourazad:
Region-based fault-tolerant distributed file storage system design in networks. Networks 66(4): 380-395 (2015) - [c8]Joydeep Banerjee, Chenyang Zhou, Arun Das, Arunabha Sen:
On Robustness in Multilayer Interdependent Networks. CRITIS 2015: 247-250 - [c7]Ran Wang, Chenyang Zhou, Anisha Mazumder, Arun Das, Hal A. Kierstead, Arunabha Sen:
Upper and lower bounds of Choice Number for successful channel assignment in cellular networks. ICC 2015: 3370-3375 - [c6]Joydeep Banerjee, Arun Das, Chenyang Zhou, Anisha Mazumder, Arunabha Sen:
On the Entity Hardening Problem in multi-layered interdependent networks. INFOCOM Workshops 2015: 648-653 - [c5]Arun Das, Chenyang Zhou, Joydeep Banerjee, Arunabha Sen, Lloyd G. Greenwald:
On the smallest pseudo target set identification problem for targeted attack on interdependent power-communication networks. MILCOM 2015: 1015-1020 - 2014
- [c4]Anisha Mazumder, Chenyang Zhou, Arun Das, Arunabha Sen:
Progressive Recovery from Failure in Multi-layered Interdependent Network Using a New Model of Interdependency. CRITIS 2014: 368-380 - [c3]Chenyang Zhou, Anisha Mazumder, Arunabha Sen, Martin Reisslein, Andréa W. Richa:
On shortest single/multiple path computation problems in Fiber-Wireless (FiWi) access networks. HPSR 2014: 131-137 - [i1]Joydeep Banerjee, Arun Das, Chenyang Zhou, Anisha Mazumder, Arunabha Sen:
On the Entity Hardening Problem in Multi-layered Interdependent Networks. CoRR abs/1412.6686 (2014) - 2013
- [j1]Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D knapsack: Packing squares. Theor. Comput. Sci. 508: 35-40 (2013) - [c2]Shahrzad Shirazipourazad, Chenyang Zhou, Zahra Derakhshandeh, Arunabha Sen:
On routing and spectrum allocation in spectrum-sliced optical networks. INFOCOM 2013: 385-389 - 2011
- [c1]Min Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D Knapsack: Packing Squares. FAW-AAIM 2011: 176-184
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 2025-09-12 23:11 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:
