A new method of assessing the students using video assignments. - U. S. N. Raju; K. V. Kadambari; P. Venkata Subba Reddy 001 (EDUCON, 2015)

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)

Complexity of Roman {2}-domination and the double Roman domination in graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (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 Roman domination in graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (J. Appl. Math. Comput., 2020)

Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (CALDAM, 2021)

Algorithmic aspects of total Roman {3}-domination in graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (Discret. Math. Algorithms Appl., 2021)

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

Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs. - Amit Sharma; P. Venkata Subba Reddy 001 (Int. J. Found. Comput. Sci., 2021)

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

Algorithmic complexity of weakly connected Roman domination in graphs. - Chakradhar Padamutham; P. Venkata Subba Reddy 001; Khandelwal Himanshu (Discret. Math. Algorithms Appl., 2022)

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)

Total vertex-edge domination in graphs: Complexity and algorithms. - Nitisha Singhwal; Venkata Subba Reddy Palagiri (Discret. Math. Algorithms Appl., 2022)

Algorithmic aspects of Roman {3}-domination in graphs. - Chakradhar Padamutham; P. Venkata Subba Reddy 001 (RAIRO Oper. Res., 2022)

Integer Linear Programming Formulations for Triple and Quadruple Roman Domination Problems. - Sanath Kumar Vengaldas; Adarsh Reddy Muthyala; Bharath Chaitanya Konkati; P. Venkata Subba Reddy 001 (CoRR, 2023)

Meta-heuristic Algorithms for Double Roman Domination Problem. - Himanshu Aggarwal; P. Venkata Subba Reddy 001 (Appl. Soft Comput., 2024)

On the total version of the covering Italian domination problem. - M. Alfred Raju; P. Venkata Subba Reddy 001; Ismael G. Yero (Discret. Appl. Math., 2024)

Metaheuristic algorithms for solving roman {2}-domination problem. - M. Alfred Raju; P. Venkata Subba Reddy 001 (RAIRO Oper. Res., 2024)

Total 2-Rainbow Domination in Graphs: Complexity and Algorithms. - Manjay Kumar; P. Venkata Subba Reddy 001 (Int. J. Found. Comput. Sci., 2024)

Complexity issues concerning the quadruple Roman domination problem in graphs. - Venkata Subba Reddy Palagiri; Guru Pratap Sharma; Ismael G. Yero (Theor. Comput. Sci., 2025)

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)