default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiansheng Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Weihao Xia, Jiansheng Cai
, Wenwen Li, Jihui Wang:
Second neighborhood via probabilistic argument. Discret. Appl. Math. 352: 49-54 (2024)- 2023
- [j24]Jiansheng Cai, Wenwen Li, Wenjing Cai, Matthias Dehmer:
List injective coloring of planar graphs. Appl. Math. Comput. 439: 127631 (2023) - [j23]Jiansheng Cai, Weihao Xia, Guiying Yan:
Quasi rmps-Pancyclicity of Regular Multipartite Tournament. Graphs Comb. 39(4): 91 (2023) - 2022
- [j22]Chenye Wang, Junhan Shi, Jiansheng Cai, Yusen Zhang, Xiaoqi Zheng, Naiqian Zhang:
DriverRWH: discovering cancer driver genes by random walk on a gene mutation hypergraph. BMC Bioinform. 23(1): 277 (2022) - [j21]Juan Wang, Zuosong Liang, Jiansheng Cai, Lianying Miao:
Acyclic coloring of claw-free graphs with small degree. Discret. Appl. Math. 321: 272-280 (2022) - [j20]Wenwen Li, Jiansheng Cai:
List injective coloring of planar graphs with disjoint 5--cycles. Discret. Math. Algorithms Appl. 14(4): 2150148:1-2150148:16 (2022) - 2021
- [c2]Kan Luo, Cong Cai, Zhichen Lai, Bingfa Huang, Jiansheng Cai, Chaobing Liang, Jianxing Li:
Measurement of Tremor on Arteriovenous Fistulas with a Flexible Capacitive Sensor. EMBC 2021: 7324-7327 - 2020
- [j19]Qian Wang, Zhi Chen, Jiansheng Cai, Zhongbao Tian:
Establishing UAV-Aided VBSs for Secure Multicasting. IEEE Wirel. Commun. Lett. 9(7): 1009-1013 (2020)
2010 – 2019
- 2019
- [j18]Qian Wang, Hang Li, Dou Zhao, Zhi Chen, Shuang Ye, Jiansheng Cai:
Deep Neural Networks for CSI-Based Authentication. IEEE Access 7: 123026-123034 (2019) - [j17]Jiansheng Cai, Chunhua Yang, Jiguo Yu:
An upper bound for the choice number of star edge coloring of graphs. Appl. Math. Comput. 348: 588-593 (2019) - 2018
- [i1]Qian Wang, Hang Li, Zhi Chen, Dou Zhao, Shuang Ye, Jiansheng Cai:
Supervised and Semi-Supervised Deep Neural Networks for CSI-Based Authentication. CoRR abs/1807.09469 (2018) - 2017
- [j16]Jiansheng Cai, Guiying Yan, Xia Zhang:
The classification of f-coloring of graphs with large maximum degree. Appl. Math. Comput. 313: 119-121 (2017) - [j15]Jiansheng Cai, Xueliang Li, Guiying Yan:
Improved upper bound for the degenerate and star chromatic numbers of graphs. J. Comb. Optim. 34(2): 441-452 (2017) - [j14]Jihui Wang, Jiansheng Cai, Baojian Qiu:
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles. Theor. Comput. Sci. 661: 1-7 (2017) - 2016
- [j13]Jihui Wang, Jiansheng Cai, Qiaoling Ma:
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles. Discret. Appl. Math. 206: 215-219 (2016) - [j12]Jiansheng Cai, Binlu Feng, Guiying Yan:
Acyclic coloring of graphs with some girth restriction. J. Comb. Optim. 31(4): 1399-1404 (2016) - 2015
- [j11]Jiansheng Cai:
List Edge Coloring of Planar Graphs Without Non-Induced 6-Cycles. Graphs Comb. 31(4): 827-832 (2015) - 2011
- [j10]Jiansheng Cai, Liansheng Ge, Xia Zhang, Guizhen Liu:
Edge-choosability of planar graphs without chordal 7-Cycles. Ars Comb. 100: 169-176 (2011)
2000 – 2009
- 2009
- [j9]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
The stability number and connected [k, k+1]-factor in graphs. Appl. Math. Lett. 22(6): 927-931 (2009) - [j8]Shuli Liu, Jiansheng Cai:
Toughness and Existence of Fractional (g, f)-factors in Graphs. Ars Comb. 93 (2009) - [j7]Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. Discret. Math. 309(1): 77-84 (2009) - [j6]Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu:
Edge-choosability of planar graphs without non-induced 5-cycles. Inf. Process. Lett. 109(7): 343-346 (2009) - 2008
- [j5]Jiansheng Cai, Guizhen Liu:
Stability Number and f-factor in K1, n-free Graphs. Ars Comb. 89 (2008) - [j4]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
Binding number and Hamiltonian (g, f)-factors in graphs II. Int. J. Comput. Math. 85(9): 1325-1331 (2008) - 2007
- [j3]Guizhen Liu, Jianfeng Hou, Jiansheng Cai:
Some results about f-critical graphs. Networks 50(3): 197-202 (2007) - [c1]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
Binding Number and Connected ( g , f + 1)-Factors in Graphs. International Conference on Computational Science (3) 2007: 313-319 - 2006
- [j2]Jiansheng Cai, Guizhen Liu:
Stability Number and Fractional F-factors in Graphs. Ars Comb. 80 (2006) - [j1]Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
List edge and list total colorings of planar graphs without 4-cycles. Theor. Comput. Sci. 369(1-3): 250-255 (2006)
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-06-03 00:15 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:
