Conflict-Free Coloring on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram (CoRR, 2019)

Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram (WG, 2020)

Conflict-free coloring on closed neighborhoods of bounded degree graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2020)

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

Conflict-free coloring on open neighborhoods of claw-free graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2021)

On the tractability of (k, i)-coloring. - Sriram Bhyravarapu; Saurabh Joshi 001; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (Discret. Appl. Math., 2021)

A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (J. Graph Theory, 2021)

List Homomorphism: Beyond the Known Boundaries. - Sriram Bhyravarapu; Satyabrata Jana; Fahad Panolan; Saket Saurabh 001; Shaily Verma (LATIN, 2022)

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (MFCS, 2022)

Conflict-Free Coloring Bounds on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (Algorithmica, 2022)

A tight bound for conflict-free coloring in terms of distance to cluster. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram (Discret. Math., 2022)

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)

Parameterized Algorithms for Eccentricity Shortest Path Problem. - Sriram Bhyravarapu; Satyabrata Jana; Lawqueen Kanesh; Saket Saurabh 001; Shaily Verma (IWOCA, 2023)

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. - Sriram Bhyravarapu; Satyabrata Jana; Saket Saurabh 001; Roohani Sharma (IPEC, 2023)

On the Parameterized Complexity of Minus Domination. - Sriram Bhyravarapu; Lawqueen Kanesh; A. Mohanapriya; Nidhi Purohit; N. Sadagopan; Saket Saurabh 001 (SOFSEM, 2024)

On locally identifying coloring of Cartesian product and tensor product of graphs. - Sriram Bhyravarapu; Swati Kumari; 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)

Polynomial Time Algorithms for Hop Domination. - D. Karthika; R. Muthucumaraswamy; Sriram Bhyravarapu; Pritesh Kumar (CALDAM, 2025)

Parameterized Algorithms for Power Edge Set and Zero Forcing Set. - Sriram Bhyravarapu; Lawqueen Kanesh; Madhumita Kundu; Daniel Lokshtanov; Saket Saurabh 001 (IWOCA, 2025)

Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components. - Sriram Bhyravarapu; Pritesh Kumar; Madhumita Kundu; Shivesh K. Roy; Sahiba; Saket Saurabh 001 (MFCS, 2025)

On the Structural Parameterized Complexity of Defective Coloring. - Sriram Bhyravarapu; Pankaj Kumar; Saket Saurabh 001 (SOFSEM (1), 2025)

On the Complexity of Minimum Membership Dominating Set. - D. Karthika; R. Muthucumaraswamy; Matthias Bentert; Sriram Bhyravarapu; Saket Saurabh 001; Sanjay Seetharaman (SOFSEM (1), 2025)

Conflict-free coloring on subclasses of perfect graphs and bipartite graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (Theor. Comput. Sci., 2025)

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

Further parameterized results on weak Grundy coloring. - D. Karthika; R. Muthucumaraswamy; Sriram Bhyravarapu; Satyabrata Jana; Saket Saurabh 001 (Theor. Comput. Sci., 2025)