P. Venkata Subba Reddy

22 papers C 1Journal 21
YearRankTypeTitle / Venue / Authors
2025 J jnl
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs.
Int. J. Found. Comput. Sci.
Amit Sharma, P. Venkata Subba Reddy, Subramanian Arumugam, Jakkepalli Pavan Kumar
2025 J jnl
Meta-Heuristic Algorithms for Quasi Total Double Roman Domination Problem.
RAIRO Theor. Informatics Appl.
Charan Karnati, M. Alfred Raju, P. Venkata Subba Reddy
2024 J jnl
Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs.
CoRR
P. Venkata Subba Reddy, Guru Pratap Sharma, Ismael González Yero
2024 J jnl
Meta-heuristic Algorithms for Double Roman Domination Problem.
Appl. Soft Comput.
Himanshu Aggarwal, P. Venkata Subba Reddy
2024 J jnl
Metaheuristic algorithms for solving roman {2}-domination problem.
RAIRO Oper. Res.
M. Alfred Raju, P. Venkata Subba Reddy
2024 J jnl
On the total version of the covering Italian domination problem.
Discret. Appl. Math.
M. Alfred Raju, P. Venkata Subba Reddy, Ismael G. Yero
2024 J jnl
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms.
Int. J. Found. Comput. Sci.
Manjay Kumar, P. Venkata Subba Reddy
2023 J jnl
Integer Linear Programming Formulations for Triple and Quadruple Roman Domination Problems.
CoRR
Sanath Kumar Vengaldas, Adarsh Reddy Muthyala, Bharath Chaitanya Konkati, P. Venkata Subba Reddy
2022 J jnl
Algorithmic aspects of Roman {3}-domination in graphs.
RAIRO Oper. Res.
Chakradhar Padamutham, P. Venkata Subba Reddy
2022 J jnl
Algorithmic aspects of outer independent Roman domination in graphs.
Discret. Math. Algorithms Appl.
Amit Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
2022 J jnl
Algorithmic complexity of weakly connected Roman domination in graphs.
Discret. Math. Algorithms Appl.
Chakradhar Padamutham, P. Venkata Subba Reddy, Khandelwal Himanshu
2021 J jnl
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs.
Int. J. Found. Comput. Sci.
Amit Sharma, P. Venkata Subba Reddy
2021 J jnl
Algorithmic aspects of secure connected domination in graphs.
Discuss. Math. Graph Theory
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2021 J jnl
Complexity issues of perfect secure domination in graphs.
RAIRO Theor. Informatics Appl.
Chakradhar Padamutham, P. Venkata Subba Reddy
2020 J jnl
Algorithmic Aspects of 2-Secure Domination in Graphs.
CoRR
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020 J jnl
Algorithmic Aspects of Secure Connected Domination in Graphs.
CoRR
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020 J jnl
Algorithmic Aspects of Some Variants of Domination in Graphs.
CoRR
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020 J jnl
Algorithmic Complexity of Isolate Secure Domination in Graphs.
CoRR
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020 J jnl
Algorithmic Complexity of Secure Connected Domination in Graphs.
CoRR
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
2020 J jnl
Algorithmic complexity of secure connected domination in graphs.
AKCE Int. J. Graphs Comb.
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
2017 J jnl
Complexity Issues of Variants of Secure Domination in Graphs.
Electron. Notes Discret. Math.
Devendra Lad, P. Venkata Subba Reddy, Jakkepalli Pavan Kumar
2015 C conf
A new method of assessing the students using video assignments.
EDUCON
U. S. N. Raju, K. V. Kadambari, P. Venkata Subba Reddy