The Linear 6-arboricity of the Complete bipartite Graph KM, n. - Shengjie He; Liancui Zuo (Discret. Math. Algorithms Appl., 2013)

Clusteringfor coordinated zero-forcing beamformingin multi-user interference networks. - Weidong Gao 003; Shengjie He; Gang Chuai (IC-NIDC, 2016)

The linear (n-1)-arboricity of some lexicographic product graphs. - Shengjie He; Rong-Xia Hao; Liancui Zuo (Appl. Math. Comput., 2018)

The linear t-arboricity of complete bipartite graphs. - Liancui Zuo; Chunhong Shang; Shaoqiang Zhang; Shengjie He (Ars Comb., 2018)

Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks. - Shengjie He; Rong-Xia Hao; Eddie Cheng 001 (Theor. Comput. Sci., 2018)

Strongly Menger connectedness of data center network and (n, k)-star graph. - Mei-Mei Gu; Shengjie He; Rong-Xia Hao; Eddie Cheng 001 (Theor. Comput. Sci., 2019)

On the edge-Szeged index of unicyclic graphs with perfect matchings. - Shengjie He; Rong-Xia Hao; Yan-Quan Feng (Discret. Appl. Math., 2020)

InViT: GAN Inversion-Based Vision Transformer for Blind Image Inpainting. - Yongqiang Du; Haoran Liu; Shengjie He; Songnan Chen (IEEE Access, 2024)