P. Venkata Subba Reddy

According to our database, P. Venkata Subba Reddy authored at least 21 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Complexity issues concerning the quadruple Roman domination problem in graphs.

Venkata Subba Reddy Palagiri, Guru Pratap Sharma, Ismael G. Yero

Theor. Comput. Sci., 2025

2024

Metaheuristic algorithms for solving roman {2}-domination problem.

M. Alfred Raju, P. Venkata Subba Reddy

RAIRO Oper. Res., 2024

On the total version of the covering Italian domination problem.

M. Alfred Raju, P. Venkata Subba Reddy, Ismael G. Yero

Discret. Appl. Math., 2024

Meta-heuristic Algorithms for Double Roman Domination Problem.

Himanshu Aggarwal, P. Venkata Subba Reddy

Appl. Soft Comput., 2024

2023

Integer Linear Programming Formulations for Triple and Quadruple Roman Domination Problems.

Sanath Kumar Vengaldas, Adarsh Reddy Muthyala, Bharath Chaitanya Konkati, P. Venkata Subba Reddy

CoRR, 2023

2022

Algorithmic aspects of Roman {3}-domination in graphs.

Chakradhar Padamutham, P. Venkata Subba Reddy

RAIRO Oper. Res., 2022

Total vertex-edge domination in graphs: Complexity and algorithms.

Nitisha Singhwal, Venkata Subba Reddy Palagiri

Discret. Math. Algorithms Appl., 2022

Algorithmic aspects of outer independent Roman domination in graphs.

Amit Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

Discret. Math. Algorithms Appl., 2022

Algorithmic complexity of weakly connected Roman domination in graphs.

Chakradhar Padamutham, P. Venkata Subba Reddy, Khandelwal Himanshu

Discret. Math. Algorithms Appl., 2022

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 Total Roman Domination in Graphs.

Amit Sharma, P. Venkata Subba Reddy

Int. J. Found. Comput. Sci., 2021

Algorithmic aspects of secure connected domination in graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

Discuss. Math. Graph Theory, 2021

Algorithmic aspects of total Roman {3}-domination in graphs.

Chakradhar Padamutham, Venkata Subba Reddy Palagiri

Discret. Math. Algorithms Appl., 2021

Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs.

Chakradhar Padamutham, Venkata Subba Reddy Palagiri

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Algorithmic aspects of Roman domination in graphs.

Chakradhar Padamutham, Venkata Subba Reddy Palagiri

J. Appl. Math. Comput., October, 2020

Algorithmic Complexity of Isolate Secure Domination in Graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

CoRR, 2020

Algorithmic Aspects of Some Variants of Domination in Graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

CoRR, 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 complexity of secure connected domination in graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

2017

Complexity Issues of Variants of Secure Domination in Graphs.

Devendra Lad, P. Venkata Subba Reddy, Jakkepalli Pavan Kumar

Electron. Notes Discret. Math., 2017

2015

A new method of assessing the students using video assignments.

U. S. N. Raju, K. V. Kadambari, P. Venkata Subba Reddy

Proceedings of the IEEE Global Engineering Education Conference, 2015