Research Interest

• Graph Algorithms, Parameterized Complexity
• Combinatorics

Education

• PhD, IIT Gandhinagar
• MSc, University of Hyderabad

Teaching

• CS202: Algorithms-I
• CS252: Algorithms-II
• CS608: Advanced Graph Algorithms
• CS502: Graph Theory and Applications
• CS201: Discrete Structures-II
• CS101: Discrete Structures-I
• CS500: Science of Computing
• IT203: Algorithm and Problem Solving
• CS601: Design and Analysis of Algorithms

Professional Experience:

• Dec 2018 onwards: Assistant Professor, Department of CSE, IIT Bhilai
• Aug 2018 to Nov 2018: Assistant Professor, IIIT Vadodara, Gujarat
• Jul 2011 to Jul 2012: Lecturer, RGUKT Basar, Telangana

List of Journal Publications

1. I Vinod Reddy, On Structural Parameterizations of Load coloring, Discrete Applied Mathematics, vol. 342, pp. 181-189, 2024.
2. Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I Vinod Reddy, Shunya Yoshimura, On Structural Parameterizations of Firefighting, Theoretical Computer Science, vol. 782, pp. 79-90, 2019.
3. I. Vinod Reddy, Parameterized Algorithms for Conflict-free Colorings of Graphs, Theoretical Com- puter Science, vol. 745, pp. 53-62, 2018.
4. Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy, “On NC algorithms for problems on bounded rank-width graphs”, Information Processing Letters, vol. 139, pp. 64-67, Nov. 2018.
5. Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy, Polynomial-time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three, Theoretical Computer Science, vol. 819, pp. 9-23, 2020,

List of Conference Publications

1. Anjeneya Swami Kare, I Vinod Reddy, Parameterized Algorithms for Graph Burning Problem, Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA), LNCS Vol 11638, pp. 304-314, 2019.
2. Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy, On Structural Parameter- izations of Firefighting,Proceedings of the 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS Vol 10743, pp. 221-234, 2018.
3. Jayesh Choudhari and I. Vinod Reddy, On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity, Proceedings of the 12th International Workshop on Algorithms and Computation (WALCOM), LNCS Vol 10755, pp. 228-239, 2018.
4. Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy, Proceedings of the 12th International Workshop on Algorithms and Computation (WALCOM), LNCS Vol 10755, pp. 252-264, 2018.
5. Neeldhara Misra, I. Vinod Reddy, The Parameterized Complexity of Happy Colorings, Proceedings of the 28 th International Workshop on Combinatorial Algorithms (IWOCA), LNCS Vol 10765, pp. 142-153, 2017.
6. Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy, On Structural Parameteri- zations of Graph Motif and Chromatic Number. Proceedings of the 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS Vol 10156, pp. 118-129, 2017.
7. Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy, Polynomial-time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. Proceedings of the 22nd Annual International Computing and Combinatorics Conference (COCOON), LNCS Vol 9797, pp. 55-66, 2016.
8. Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy, Logspace and fpt algorithms for graph iso- morphism for subclasses of bounded tree-width graphs. Proceedings of 9th International Conference and Workshops on Algorithms and Computation (WALCOM), LNCS Vol 8973, pp. 329-334, 2015.
9. Murali Krishna Enduri, I. Vinod Reddy, and Shivakumar Jolad. Does diversity of papers affect their citations? Evidence from American Physical Society Journals. Proceedings of 11 th International Conference on Signal-Image Technology and Internet-Based Systems (SITIS), pp. 505-511. IEEE, 2015.