default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShujuan Cao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Mingyuan Li, Lei Meng, Zhonglin Ye, Yanglin Yang, Shujuan Cao, Yuzhi Xiao, Haixing Zhao:
TP-GCL: graph contrastive learning from the tensor perspective. Frontiers Neurorobotics 18 (2024)- [j13]Mingyuan Li, Lei Meng, Zhonglin Ye, Yanlin Yang, Shujuan Cao
, Yuzhi Xiao, Haixing Zhao:
GSGSL: Gravity-driven self-supervised graph structure learning. Inf. Process. Manag. 61(4): 103744 (2024) - [j12]Mingyuan Li, Lei Meng, Zhonglin Ye, Yuzhi Xiao, Shujuan Cao, Haixing Zhao:
Line graph contrastive learning for node classification. J. King Saud Univ. Comput. Inf. Sci. 36(4): 102011 (2024) - 2023
- [j11]Shujuan Cao, Hui Lei, Xiaopan Lian, Shunyu Yao, Junxue Zhang:
Saturation numbers for tPk with k less than 6. Discret. Appl. Math. 325: 108-119 (2023) - [j10]Shujuan Cao, Xiaoming Wang, Zhonglin Ye, Mingyuan Li, Haixing Zhao:
LGNN: a novel linear graph neural network algorithm. Frontiers Comput. Neurosci. 17 (2023) - [c3]Mingyuan Li, Lei Meng, Zhonglin Ye, Haixing Zhao, Yuzhi Xiao, Shujuan Cao:
Multi-scale Heterogeneous Graph Contrastive Learning*. IEEE Big Data 2023: 4432-4441 - [c2]Yanglin Yang, Zhonglin Ye, Haixing Zhao, Gege Li, Shujuan Cao:
BLR: A Multi-modal Sentiment Analysis Model. ICANN (10) 2023: 466-478 - 2021
- [j9]Chen Zhou, Haiyan Guo, Shujuan Cao:
Gene Network Analysis of Alzheimer's Disease Based on Network and Statistical Methods. Entropy 23(10): 1365 (2021) - 2020
- [j8]Shujuan Cao, Yuede Ma, Zhenyu Taoqiu:
A note on rainbow saturation number of paths. Appl. Math. Comput. 378: 125204 (2020) - [j7]Modjtaba Ghorbani, Matthias Dehmer, Shujuan Cao, Lihua Feng, Jin Tao, Frank Emmert-Streib:
On the zeros of the partial Hosoya polynomial of graphs. Inf. Sci. 524: 199-215 (2020)
2010 – 2019
- 2019
- [j6]Yuede Ma, Shujuan Cao, Yongtang Shi, Matthias Dehmer, Chengyi Xia:
Nordhaus-Gaddum type results for graph irregularities. Appl. Math. Comput. 343: 268-272 (2019) - [j5]Shujuan Cao, Shenwei Huang:
Graphs without five-vertex path and four-vertex cycle. Appl. Math. Comput. 363 (2019) - 2017
- [j4]Shujuan Cao, Matthias Dehmer, Zhe Kang:
Network Entropies Based on Independent Sets and Matchings. Appl. Math. Comput. 307: 265-270 (2017) - 2015
- [j3]Shujuan Cao, Matthias Dehmer:
Degree-based entropies of networks revisited. Appl. Math. Comput. 261: 141-147 (2015) - [j2]Qing Tian, Shujuan Cao, Chunxiao Yang:
On a problem analogues to Lehmer's and Hurwitz zeta-function. Appl. Math. Comput. 268: 636-643 (2015) - 2014
- [j1]Shujuan Cao, Matthias Dehmer, Yongtang Shi:
Extremality of degree-based graph entropies. Inf. Sci. 278: 22-33 (2014)
2000 – 2009
- 2007
- [c1]Xiaomao Liu, Shujuan Cao, Junbin Gao, Jun Zhang:
The Kernelized Geometrical Bisection Methods. ISNN (2) 2007: 680-688
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-22 21:17 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:
