I. Vinod Reddy

EDBT 2026 Demo / reviewers in the wild / expert

dblp:158/8471 · DBLP profile ↗

← Back

18ranked-venue papers

2as first author

7since 2021 · last 2026

0000-0002-0365-1138ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 18 · 2 first-author · 7 since 2021Databases, data management, data science and information retrieval · 1

Year	Publication	Venue	Position
2026	On the parameterized complexity of odd coloring Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy	Theor. Comput. Sci.	3
2025	Dynamic coloring on restricted graph classes Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy	Theor. Comput. Sci.	3
2024	Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang 0001, Subrahmanyam Kalyanasundaram, I. Vinod Reddy	Algorithmica	5
2024	On locally identifying coloring of Cartesian product and tensor product of graphs Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy	Discret. Appl. Math.	3
2024	On structural parameterizations of load coloring I. Vinod Reddy	Discret. Appl. Math.	1
2023	Dynamic Coloring on Restricted Graph Classes Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy	CIAC	3
2021	Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy	IWOCA	4
2020	Evolution of Physics Sub-fields Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad	COMPLEXIS	2
2020	Parameterized complexity of happy coloring problems Akanksha Agrawal 0001, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy	Theor. Comput. Sci.	7
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.	3
2019	Parameterized Algorithms for Graph Burning Problem Anjeneya Swami Kare, I. Vinod Reddy	IWOCA	2
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.	6
2018	On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity Jayesh Choudhari, I. Vinod Reddy	WALCOM	2
2018	On the Parallel Parameterized Complexity of the Graph Isomorphism Problem Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy	WALCOM	3
2018	On NC algorithms for problems on bounded rank-width graphs Bireswar Das, Anirban Dasgupta 0001, Murali Krishna Enduri, I. Vinod Reddy	Inf. Process. Lett.	4
2018	Parameterized algorithms for conflict-free colorings of graphs I. Vinod Reddy	Theor. Comput. Sci.	1
2017	The Parameterized Complexity of Happy Colorings Neeldhara Misra, I. Vinod Reddy	IWOCA	2
2016	Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy	COCOON	3