Stability Number and Fractional F-factors in Graphs. - Jiansheng Cai; Guizhen Liu (Ars Comb., 2006)

List edge and list total colorings of planar graphs without 4-cycles. - Jianfeng Hou; Guizhen Liu; Jiansheng Cai (Theor. Comput. Sci., 2006)

Binding Number and Connected ( g , f + 1)-Factors in Graphs. - Jiansheng Cai; Guizhen Liu; Jianfeng Hou (International Conference on Computational Science (3), 2007)

Some results about f-critical graphs. - Guizhen Liu; Jianfeng Hou; Jiansheng Cai (Networks, 2007)

Stability Number and f-factor in K1, n-free Graphs. - Jiansheng Cai; Guizhen Liu (Ars Comb., 2008)

Binding number and Hamiltonian (g, f)-factors in graphs II. - Jiansheng Cai; Guizhen Liu; Jianfeng Hou (Int. J. Comput. Math., 2008)

The stability number and connected [k, k+1]-factor in graphs. - Jiansheng Cai; Guizhen Liu; Jianfeng Hou (Appl. Math. Lett., 2009)

Toughness and Existence of Fractional (g, f)-factors in Graphs. - Shuli Liu; Jiansheng Cai (Ars Comb., 2009)

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. - Jianfeng Hou; Guizhen Liu; Jiansheng Cai (Discret. Math., 2009)

Edge-choosability of planar graphs without non-induced 5-cycles. - Jiansheng Cai; Jianfeng Hou; Xia Zhang; Guizhen Liu (Inf. Process. Lett., 2009)

Edge-choosability of planar graphs without chordal 7-Cycles. - Jiansheng Cai; Liansheng Ge; Xia Zhang; Guizhen Liu (Ars Comb., 2011)

List Edge Coloring of Planar Graphs Without Non-Induced 6-Cycles. - Jiansheng Cai (Graphs Comb., 2015)

Neighbor sum distinguishing total choosability of planar graphs without 4-cycles. - Jihui Wang; Jiansheng Cai; Qiaoling Ma (Discret. Appl. Math., 2016)

Acyclic coloring of graphs with some girth restriction. - Jiansheng Cai; Binlu Feng; Guiying Yan (J. Comb. Optim., 2016)

The classification of f-coloring of graphs with large maximum degree. - Jiansheng Cai; Guiying Yan; Xia Zhang (Appl. Math. Comput., 2017)

Improved upper bound for the degenerate and star chromatic numbers of graphs. - Jiansheng Cai; Xueliang Li 001; Guiying Yan (J. Comb. Optim., 2017)

Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles. - Jihui Wang; Jiansheng Cai; Baojian Qiu (Theor. Comput. Sci., 2017)

Supervised and Semi-Supervised Deep Neural Networks for CSI-Based Authentication. - Qian Wang 004; Hang Li; Zhi Chen 002; Dou Zhao; Shuang Ye; Jiansheng Cai (CoRR, 2018)

Deep Neural Networks for CSI-Based Authentication. - Qian Wang 004; Hang Li; Dou Zhao; Zhi Chen 002; Shuang Ye; Jiansheng Cai (IEEE Access, 2019)

An upper bound for the choice number of star edge coloring of graphs. - Jiansheng Cai; Chunhua Yang; Jiguo Yu (Appl. Math. Comput., 2019)

Establishing UAV-Aided VBSs for Secure Multicasting. - Qian Wang 004; Zhi Chen 002; Jiansheng Cai; Zhongbao Tian (IEEE Wirel. Commun. Lett., 2020)

Measurement of Tremor on Arteriovenous Fistulas with a Flexible Capacitive Sensor. - Kan Luo; Cong Cai; Zhichen Lai 001; Bingfa Huang; Jiansheng Cai; Chaobing Liang; Jianxing Li (EMBC, 2021)

DriverRWH: discovering cancer driver genes by random walk on a gene mutation hypergraph. - Chenye Wang; Junhan Shi; Jiansheng Cai; Yusen Zhang 002; Xiaoqi Zheng; Naiqian Zhang (BMC Bioinform., 2022)

Acyclic coloring of claw-free graphs with small degree. - Juan Wang; Zuosong Liang; Jiansheng Cai; Lianying Miao (Discret. Appl. Math., 2022)

List injective coloring of planar graphs with disjoint 5–cycles. - Wenwen Li; Jiansheng Cai (Discret. Math. Algorithms Appl., 2022)

List injective coloring of planar graphs. - Jiansheng Cai; Wenwen Li; Wenjing Cai; Matthias Dehmer (Appl. Math. Comput., 2023)

Quasi rmps-Pancyclicity of Regular Multipartite Tournament. - Jiansheng Cai; Weihao Xia 003; Guiying Yan (Graphs Comb., 2023)

Second neighborhood via probabilistic argument. - Weihao Xia 003; Jiansheng Cai; Wenwen Li; Jihui Wang (Discret. Appl. Math., 2024)