On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. - Yue Wang 050; Jianliang Wu 001; Donglei Yang (Discret. Math., 2019)

An improved linear connectivity bound for tournaments to be highly linked. - Wei Meng; Martin Rolek; Yue Wang 050; Gexin Yu (Eur. J. Comb., 2021)

Sufficient Conditions for 2-Dimensional Global Rigidity. - Xiaofeng Gu 002; Wei Meng; Martin Rolek; Yue Wang 050; Gexin Yu (SIAM J. Discret. Math., 2021)

Partition graphs of independence number 2 into two subgraphs with large chromatic numbers. - Yue Wang 050; Gexin Yu (Discret. Math., 2022)

On generalized neighbor sum distinguishing index of planar graphs. - Jieru Feng; Yue Wang 050; Jianliang Wu 001 (Discret. Math. Algorithms Appl., 2022)

A conforming discontinuous Galerkin finite element method for elliptic interface problems. - Yue Wang 050; Fuzheng Gao; Jintao Cui (J. Comput. Appl. Math., 2022)

Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. - Yue Wang 050; Gexin Yu (J. Graph Theory, 2022)

A Conforming Discontinuous Galerkin Finite Element Method for Linear Elasticity Interface Problems. - Yue Wang 050; Fuzheng Gao; Jintao Cui (J. Sci. Comput., 2022)

4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. - Fan Yang 085; Yue Wang 050; Jian-Liang Wu 001 (Discret. Math., 2023)

Superconvergence of the lowest-order weak Galerkin finite element method for elliptic interface problems. - Yue Wang 050; Fuzheng Gao; Jintao Cui (Comput. Math. Appl., 2023)

The lowest-order weak Galerkin finite element method for linear elasticity problems on convex polygonal grids. - Yue Wang 050; Fuzheng Gao (Commun. Nonlinear Sci. Numer. Simul., 2024)

Generalized weak Galerkin finite element method for linear elasticity interface problems. - Yue Wang 050; Fuzheng Gao (Numer. Algorithms, 2025)