default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeidong Chen 0009
Person information
- affiliation: South China Normal University, Guangzhou, China
Other persons with the same name
- Weidong Chen — disambiguation page
- Weidong Chen 0001
![[0000-0001-8757-0679]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8757-0679")
— Shanghai Jiao Tong University, China - Weidong Chen 0002 — Zhejiang University, Qiushi Academy for Advanced Studies, Hangzhou, China
- Weidong Chen 0003 — Henan University of Technology, Zhengzhou, China
- Weidong Chen 0004 — National University of Singapore
- Weidong Chen 0005 — Southern Methodist University, Dallas, TX, USA
- Weidong Chen 0006 — University of Michigan, Ann Arbor, Michigan, USA
- Weidong Chen 0007 — Tianjin University, Tianjin, China
- Weidong Chen 0008 — LinkAir Communications, Inc., San Jose, CA, USA
- Weidong Chen 0010 — University of Science and Technology of China, Hefei, Anhui, China
- Weidong Chen 0011 — IBM Santa Teresa Laboratory, San Jose, CA, USA
- Weidong Chen 0012 — Université du Littoral Côte d'Opale, Dnkerque, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j10]Wenjun Xiao, Weidong Chen, Behrooz Parhami:
Interconnection Networks with Hypercubic Skeletons. J. Interconnect. Networks 15(1-2): 1550006:1-1550006:14 (2015)- 2014
- [j9]Weidong Chen, Zaixin Lu, Weili Wu:
Dominating problems in swapped networks. Inf. Sci. 269: 286-299 (2014) - 2013
- [j8]Zaixin Lu, Weili Wu, Weidong Chen, Jiaofei Zhong, Yuanjun Bi, Zheng Gao:
The Maximum Community Partition Problem in Networks. Discret. Math. Algorithms Appl. 5(4) (2013) - [c6]Zheng Gao, Weili Wu, Zaixin Lu, Weidong Chen, Jiaofei Zhong, Yuanjun Bi:
The Maximum Community Partition Problem in Networks. SOCIETY 2013: 28-36 - [c5]Jiaofei Zhong, Zheng Gao, Weili Wu, Weidong Chen, Xiaofeng Gao, Xiaodong Yue:
High performance energy efficient multi-channel wireless data broadcasting system. WCNC 2013: 4346-4351 - 2012
- [j7]Weidong Chen, Wenjun Xiao, Behrooz Parhami:
Nearly Optimal Node-to-Set Parallel Routing in OTIS Networks. J. Interconnect. Networks 13(1-2) (2012) - 2011
- [j6]Wenjun Xiao, Behrooz Parhami, Weidong Chen, Mingxin He, Wenhong Wei:
Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks. Int. J. Comput. Math. 88(13): 2669-2684 (2011) - [j5]Wenjun Xiao, Weidong Chen, Behrooz Parhami:
On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems. Int. J. Syst. Sci. 42(6): 951-958 (2011) - [j4]Wenjun Xiao, Qin Zhang, Yanxia Liu, Lan Li, Weidong Chen:
CHC: A Robust P2P Overlay Network with Simple Routing and Small-World Features. J. Networks 6(8): 1179-1186 (2011) - 2010
- [j3]Wenjun Xiao, Behrooz Parhami, Weidong Chen, Mingxin He, Wenhong Wei:
Fully symmetric swapped networks based on bipartite cluster connectivity. Inf. Process. Lett. 110(6): 211-215 (2010)
2000 – 2009
- 2009
- [j2]Weidong Chen, Wenjun Xiao, Behrooz Parhami:
Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant. IEEE Trans. Parallel Distributed Syst. 20(3): 361-366 (2009) - 2008
- [j1]Wenjun Xiao, Wenhong Wei, Weidong Chen, Mingxin He, Behrooz Parhami:
Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs. IEEE Trans. Computers 57(12): 1726-1728 (2008) - [c4]Weidong Chen, Wenjun Xiao:
Constructing Node-Disjoint Paths in Biswapped Networks (BSNs). GPC Workshops 2008: 256-261 - 2007
- [c3]Weidong Chen, Wenjun Xiao, Behrooz Parhami:
An Efficient Construction of Node Disjoint Paths in OTIS Networks. APPT 2007: 180-189 - [c2]Mingxin He, Wenjun Xiao, Weidong Chen, Wenhong Wei, Zhen Zhang:
General Biswapped Networks and Their Topological Properties. APPT 2007: 414-422 - [c1]Wenjun Xiao, Weidong Chen, Mingxin He, Wenhong Wei, Behrooz Parhami:
Biswapped Networks and Their Topological Properties. SNPD (2) 2007: 193-198
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-23 21:21 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:
