I. Vinod Reddy

According to our database, I. Vinod Reddy authored at least 25 papers between 2015 and 2025.

Collaborative distances:

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

2025

Dynamic coloring on restricted graph classes.

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Theor. Comput. Sci., 2025

On the Parameterized Complexity of Odd Coloring.

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Algorithmica, July, 2024

On structural parameterizations of load coloring.

I. Vinod Reddy

Discret. Appl. Math., January, 2024

On locally identifying coloring of Cartesian product and tensor product of graphs.

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Discret. Appl. Math., 2024

2023

On Color Critical Graphs of Star Coloring.

Harshit Kumar Choudhary, I. Vinod Reddy

CoRR, 2023

On Structural Parameterizations of Star Coloring.

Sriram Bhyravarapu, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

On Locally Identifying Coloring of Graphs.

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2021

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.

Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

Theor. Comput. Sci., 2020

Parameterized complexity of happy coloring problems.

Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy

Theor. Comput. Sci., 2020

Evolution of Physics Sub-fields.

Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad

Proceedings of the 5th International Conference on Complexity, 2020

2019

On structural parameterizations of firefighting.

Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura

Theor. Comput. Sci., 2019

Parameterized Coloring Problems on Threshold Graphs.

I. Vinod Reddy

CoRR, 2019

Parameterized Algorithms for Graph Burning Problem.

Anjeneya Swami Kare, I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Parameterized algorithms for conflict-free colorings of graphs.

I. Vinod Reddy

Theor. Comput. Sci., 2018

On NC algorithms for problems on bounded rank-width graphs.

Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy

Inf. Process. Lett., 2018

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity.

Jayesh Choudhari, I. Vinod Reddy

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

On Structural Parameterizations of Firefighting.

Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

The Parameterized Complexity of Happy Colorings.

Neeldhara Misra, I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

On Structural Parameterizations of Graph Motif and Chromatic Number.

Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2015

Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

CoRR, 2015

Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Does Diversity of Papers Affect Their Citations? Evidence from American Physical Society Journals.

Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad

Proceedings of the 11th International Conference on Signal-Image Technology & Internet-Based Systems, 2015