Roman {k}-domination in trees and complexity results for some classes of graphs. - Cai-Xia Wang; Yu Yang; Hong-Juan Wang; Shou-Jun Xu (J. Comb. Optim., 2021)

Secure connected domination and secure total domination in unit disk graphs and rectangle graphs. - Cai-Xia Wang; Yu Yang; Shou-Jun Xu (Theor. Comput. Sci., 2023)

Algorithmic aspects of secure domination in unit disk graphs. - Cai-Xia Wang; Yu Yang; Shou-Jun Xu (Inf. Comput., 2023)

Algorithmic and complexity aspects of problems related to total restrained domination for graphs. - Yu Yang; Cai-Xia Wang; Shou-Jun Xu (J. Comb. Optim., 2023)

The Characterizations and Complexity of Roman {2}-Domination and 2-Domination in Graphs. - Cai-Xia Wang; Yu Yang; Ze-Peng Li; Shou-Jun Xu (AAIM (2), 2024)

Total (restrained) domination in unit disk graphs. - Yu Yang; Cai-Xia Wang; Shou-Jun Xu (Inf. Comput., 2024)

A Survey on Variant Domination Problems in Geometric Intersection Graphs. - Shou-Jun Xu; Cai-Xia Wang; Yu Yang (Parallel Process. Lett., 2024)

A Characterization of Graphs with Semitotal Domination Number One-Third Their Order. - Jie Chen; Cai-Xia Wang; Yi-Ping Liang; Shou-Jun Xu (Graphs Comb., 2024)

The algorithm and complexity of secure domination in 3-dimensional box graphs. - Cai-Xia Wang; Yu Yang; Shou-Jun Xu (Discret. Appl. Math., 2025)

Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound. - Jie Chen; Yi-Ping Liang; Cai-Xia Wang; Shou-Jun Xu (Inf. Process. Lett., 2025)

Discriminating code and set cover with k-bend paths. - Yu Yang; Cai-Xia Wang; Shou-Jun Xu (Theor. Comput. Sci., 2025)

The algorithm and complexity of co-secure domination in geometric intersection graphs. - Cai-Xia Wang; Yu Yang; Shou-Jun Xu (Comput. Appl. Math., 2025)