I. Vinod Reddy

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 31

Top Topics

Structural Analysis

Graph Isomorphism

Papers Published

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

I. Vinod Reddy
On structural parameterizations of load coloring. Discret. Appl. Math. 342 (2024)
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
On locally identifying coloring of Cartesian product and tensor product of graphs. Discret. Appl. Math. 358 (2024)
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica 86 (7) (2024)
Sriram Bhyravarapu, I. Vinod Reddy
On Structural Parameterizations of Star Coloring. CALDAM (2023)
Harshit Kumar Choudhary, I. Vinod Reddy
On Color Critical Graphs of Star Coloring. CoRR (2023)
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
Dynamic Coloring on Restricted Graph Classes. CIAC (2023)
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
On Locally Identifying Coloring of Graphs. CALDAM (2023)
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs. CoRR (2023)
Sriram Bhyravarapu, I. Vinod Reddy
On Structural Parameterizations of Star Coloring. CoRR (2022)
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. IWOCA (2021)
I. Vinod Reddy
On Structural Parameterizations of Load Coloring. CALDAM (2021)
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. CoRR (2021)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. Theor. Comput. Sci. 819 (2020)
I. Vinod Reddy
On Structural Parameterizations of Load Coloring. CoRR (2020)
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835 (2020)
Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad
Evolution of Physics Sub-fields. COMPLEXIS (2020)
Anjeneya Swami Kare, I. Vinod Reddy
Parameterized Algorithms for Graph Burning Problem. IWOCA (2019)
I. Vinod Reddy
Parameterized Coloring Problems on Threshold Graphs. CoRR (2019)
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
On structural parameterizations of firefighting. Theor. Comput. Sci. 782 (2019)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. WALCOM (2018)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Firefighting. CALDAM (2018)
Jayesh Choudhari, I. Vinod Reddy
On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. WALCOM (2018)
Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy
On NC algorithms for problems on bounded rank-width graphs. Inf. Process. Lett. 139 (2018)
I. Vinod Reddy
Parameterized algorithms for conflict-free colorings of graphs. Theor. Comput. Sci. 745 (2018)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. CoRR (2017)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Firefighting. CoRR (2017)
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM (2017)
Neeldhara Misra, I. Vinod Reddy
The Parameterized Complexity of Happy Colorings. IWOCA (2017)
I. Vinod Reddy
Parameterized Algorithms for Conflict-free Colorings of Graphs. CoRR (2017)
Neeldhara Misra, I. Vinod Reddy
The Parameterized Complexity of Happy Colorings. CoRR (2017)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. COCOON (2016)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3. CoRR (2015)
Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad
Does diversity of papers affect their citations? Evidence from American Physical Society Journals. CoRR (2015)
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. WALCOM (2015)
Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad
Does Diversity of Papers Affect Their Citations? Evidence from American Physical Society Journals. SITIS (2015)