Does Diversity of Papers Affect Their Citations? Evidence from American Physical Society Journals. - Murali Krishna Enduri; I. Vinod Reddy; Shivakumar Jolad (SITIS, 2015)

Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (WALCOM, 2015)

Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (CoRR, 2015)

On Structural Parameterizations of Graph Motif and Chromatic Number. - Bireswar Das; Murali Krishna Enduri; Neeldhara Misra; I. Vinod Reddy (CALDAM, 2017)

The Parameterized Complexity of Happy Colorings. - Neeldhara Misra; I. Vinod Reddy (IWOCA, 2017)

On Structural Parameterizations of Firefighting. - Bireswar Das; Murali Krishna Enduri; Neeldhara Misra; I. Vinod Reddy (CALDAM, 2018)

On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. - Jayesh Choudhari; I. Vinod Reddy (WALCOM, 2018)

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. - Bireswar Das; Murali Krishna Enduri; I. Vinod Reddy (WALCOM, 2018)

On NC algorithms for problems on bounded rank-width graphs. - Bireswar Das; Anirban Dasgupta 001; Murali Krishna Enduri; I. Vinod Reddy (Inf. Process. Lett., 2018)

Parameterized algorithms for conflict-free colorings of graphs. - I. Vinod Reddy (Theor. Comput. Sci., 2018)

Parameterized Algorithms for Graph Burning Problem. - Anjeneya Swami Kare; I. Vinod Reddy (IWOCA, 2019)

Parameterized Coloring Problems on Threshold Graphs. - I. Vinod Reddy (CoRR, 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)

Evolution of Physics Sub-fields. - Murali Krishna Enduri; I. Vinod Reddy; Shivakumar Jolad (COMPLEXIS, 2020)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 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)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. - Sriram Bhyravarapu; Tim A. Hartmann; Subrahmanyam Kalyanasundaram; I. Vinod Reddy (IWOCA, 2021)

On Locally Identifying Coloring of Graphs. - Sriram Bhyravarapu; Swati Kumari; I. Vinod Reddy (CALDAM, 2023)

On Structural Parameterizations of Star Coloring. - Sriram Bhyravarapu; I. Vinod Reddy (CALDAM, 2023)

On Color Critical Graphs of Star Coloring. - Harshit Kumar Choudhary; I. Vinod Reddy (CoRR, 2023)

On locally identifying coloring of Cartesian product and tensor product of graphs. - Sriram Bhyravarapu; Swati Kumari; I. Vinod Reddy (Discret. Appl. Math., 2024)

On structural parameterizations of load coloring. - I. Vinod Reddy (Discret. Appl. Math., 2024)

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. - Sriram Bhyravarapu; Tim A. Hartmann; Hung P. Hoang 001; Subrahmanyam Kalyanasundaram; I. Vinod Reddy (Algorithmica, 2024)

On the Parameterized Complexity of Odd Coloring. - Sriram Bhyravarapu; Swati Kumari; I. Vinod Reddy (CALDAM, 2025)

Dynamic coloring on restricted graph classes. - Sriram Bhyravarapu; Swati Kumari; I. Vinod Reddy (Theor. Comput. Sci., 2025)