...

Prof. P Venkata Subba Reddy

PhD (NIT Trichy)

Associate Professor

Department of Computer Science and Engineering

Room No: Ground Floor, CSE Main Building +91-870-2462741
pvsr@nitw.ac.in
8790590436 Edit Profile Bio Sketch

Research Areas

 Domination in Graphs

 Optimization Algorithms

  • Courses Handled
  • Research IDs
  • Selected Publications
  • Project/Consultancy
  • Current PhD Students
  • Awards and Accolades
  • Additional Responsibilities
  • Quantum Computing(CS6323)
  • Design and Analysis of Algorithms(CS204)
  • Dissertation Work Part - B(CS6299)
  • Quantum Computing(CS366)
  • Algorithm Analysis and Design(CS5353)
  • Computer Networks Laboratory(CS308)
  • Discrete Mathematics(CS151)
  • Mathematics for Computer Science(CS5102)
  • Computational Mathematics Practice(CS5204)
  • Advanced Algorithms(CS5101)
  • ORC ID: 0000-0002-0972-1141
  • SCOPUS ID: 36349630100
  • Google Scholar ID: _AsSZGUAAAAJ


  • Meta-heuristic Algorithms for Double Roman Domination Problem, By Himanshu Aggarwal and P. Venkata Subba Reddy, Elsevier, Applied Soft Computing, vol.154, pp.111306, 2024
  • Total 2-Rainbow Domination in Graphs: Complexity and Algorithms, By Manjay Kumar and P. Venkata Subba Reddy, World Scientific, International Journal of Foundations of Computer Science, vol., pp., 2023
  • Algorithmic Aspects of Roman {3}-Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, EDP Sciences, RAIRO - Operations Research, vol.56 (4), pp.2277 - 2291, 2022
  • Algorithmic Aspects of 2-Secure Domination in Graphs, By J. Pavan Kumar and P. Venkata Subba Reddy, Springer, Journal of Combinatorial Optimization, vol.42, pp.56-70, 2021
  • Algorithmic Aspects of Secure Connected Domination in Graphs, By J. Pavan Kumar and P. Venkata Subba Reddy, DMGT, Discussiones Mathematicae Graph Theory, vol.41, pp.1179-1197, 2021
  • Complexity Issues of Perfect Secure Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, EDP Sciences, RAIRO - Theoretical Informatics and Applications, vol.55, pp.11, 2021
  • Complexity Aspects of Variants of Independent Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Springer, Bulletin of the Iranian Mathematical Society, vol.47, pp.1715-1735, 2021
  • Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs, By Amit Sharma and P. Venkata Subba Reddy, World Scientific, International Journal of Foundations of Computer Science, vol.32(3), pp.331-339, 2021
  • Algorithmic Aspects of Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Springer, Journal of Applied Mathematics and Computing, vol.64, pp.89-102, 2020
  • Complexity of Roman {2}-Domination and the Double Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Taylor & Francis, AKCE International Journal of Graphs and Combinatorics, vol.17 (3), pp.1081-1086, 2020


Alfred Raju

  • Area of Research: Complexity Issues and Optimization Algorithms for Domination

Syed Nawaz Pasha

  • Area of Research: Optimization Algorithms for Graph Domination Problems

Y. Chanti

  • Area of Research: Metaheuristic Algorithms for NP-hard Domination Problems
  • SERB International Research Experience (SIRE)
  • Warden 1 K Hostel (March, 2018 - November, 2020)
  • Treasurer, CSEA (August, 2013 - August, 2022)