default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenping Zheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j16]Gui Yang, Wenping Zheng, Chenhao Che, Wenjian Wang:
Graph-based label propagation algorithm for community detection. Int. J. Mach. Learn. Cybern. 11(6): 1319-1329 (2020)- 2019
- [j15]Jie Wang, Jiye Liang
, Wenping Zheng, Xingwang Zhao, Junfang Mu:
Protein complex detection algorithm based on multiple topological characteristics in PPI networks. Inf. Sci. 489: 78-92 (2019) - [j14]Jie Wang, Jiye Liang, Xingwang Zhao, Wenping Zheng:
一种基于同配性的重叠蛋白质复合体检测算法 (Overlapping Protein Complexes Detection Algorithm Based on Assortativity in PPI Networks). 计算机科学 46(2): 294-300 (2019) - [j13]Junfang Mu, Wenping Zheng, Jie Wang, Jiye Liang:
A novel edge rewiring strategy for tuning structural properties in networks. Knowl. Based Syst. 177: 55-67 (2019) - 2018
- [j12]Wenping Zheng, Rui Qu, Junfang Mu:
具有社区结构的无标度网络生成算法 (Generation Algorithm for Scale-free Networks with Community Structure). 计算机科学 45(2): 76-83 (2018) - [j11]Bing Guo, Wenping Zheng, Suqing Han:
一种基于突变基因网络的癌症驱动通路识别算法 (Driver Pathway Identification Algorithm Based on Mutated Gene Networks for Cancer). 计算机科学 45(7): 230-236 (2018) - 2017
- [j10]Haoli Wang, Xirong Xu, Yuansheng Yang, Bao Liu, Wenping Zheng, Guoqing Wang:
An upper bound for the crossing number of locally twisted cubes. Ars Comb. 131: 87-106 (2017) - 2013
- [j9]Guoqing Wang, Haoli Wang, Yuansheng Yang, Xuezhi Yang, Wenping Zheng:
An upper bound for the crossing number of augmented cubes. Int. J. Comput. Math. 90(2): 183-227 (2013) - 2011
- [j8]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The Crossing Numbers of Cartesian Product of Cone Graph Cm + Kl with Path Pn. Ars Comb. 98: 433-335 (2011) - 2009
- [j7]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Gui Yang:
On the Crossing Numbers of the k-th Power of Pn. Ars Comb. 92 (2009) - [j6]Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi, Weiming Lu:
The crossing numbers of generalized Petersen graphs with small order. Discret. Appl. Math. 157(5): 1016-1023 (2009) - 2008
- [j5]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The crossing number of flower snarks and related graphs. Ars Comb. 86 (2008) - [j4]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chengrui Deng:
On the crossing numbers of Kmsquare Cn and Km, lsquare Pn. Discret. Appl. Math. 156(10): 1892-1907 (2008) - [j3]Wenping Zheng, Xiaohui Lin, Yuansheng Yang:
The crossing number of K2, mPn. Discret. Math. 308(24): 6639-6644 (2008) - 2007
- [j2]Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Wenping Zheng:
On the Three Color Ramsey Numbers R(Cm, C4, C4). Ars Comb. 84 (2007) - [j1]Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Chong Cui:
On the Crossing Number of K m P n . Graphs Comb. 23(3): 327-336 (2007)
Conference and Workshop Papers
- 2022
- [c1]Wenping Zheng, Meilin Liu, Jiye Liang:
Hypergraphs: Concepts, Applications and Analysis. PAAP 2022: 1-6
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-05-08 21:46 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:
