Complexity Issues of Variants of Secure Domination in Graphs. - Devendra Lad; P. Venkata Subba Reddy 001; Jakkepalli Pavan Kumar (Electron. Notes Discret. Math., 2017)

Algorithmic complexity of secure connected domination in graphs. - Jakkepalli Pavan Kumar; P. Venkata Subba Reddy 001; S. Arumugam 001 (AKCE Int. J. Graphs Comb., 2020)

Algorithmic Aspects of Some Variants of Domination in Graphs. - Jakkepalli Pavan Kumar; P. Venkata Subba Reddy 001 (CoRR, 2020)

Algorithmic Complexity of Isolate Secure Domination in Graphs. - Jakkepalli Pavan Kumar; P. Venkata Subba Reddy 001 (CoRR, 2020)

Algorithmic aspects of secure connected domination in graphs. - Jakkepalli Pavan Kumar; P. Venkata Subba Reddy 001 (Discuss. Math. Graph Theory, 2021)

Algorithmic aspects of 2-secure domination in graphs. - Jakkepalli Pavan Kumar; Venkata Subba Reddy Palagiri (J. Comb. Optim., 2021)

Algorithmic aspects of outer independent Roman domination in graphs. - Amit Sharma; Jakkepalli Pavan Kumar; P. Venkata Subba Reddy 001; S. Arumugam 001 (Discret. Math. Algorithms Appl., 2022)

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs. - Amit Sharma; P. Venkata Subba Reddy 001; Subramanian Arumugam 001; Jakkepalli Pavan Kumar (Int. J. Found. Comput. Sci., 2025)