Sriram Bhyravarapu

According to our database, Sriram Bhyravarapu authored at least 18 papers between 2019 and 2024.

Collaborative distances:

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

2024

On the Parameterized Complexity of Minus Domination.

Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs.

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

CoRR, 2023

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity.

Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Algorithms for Eccentricity Shortest Path Problem.

Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Dynamic Coloring on Restricted Graph Classes.

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

Proceedings of the Algorithms and Complexity - 13th International Conference, 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

2022

A tight bound for conflict-free coloring in terms of distance to cluster.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

Discret. Math., 2022

Conflict-Free Coloring Bounds on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Algorithmica, 2022

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

List Homomorphism: Beyond the Known Boundaries.

Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

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

On the tractability of (k, i)-coloring.

Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Discret. Appl. Math., 2021

Conflict-free coloring on open neighborhoods of claw-free graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 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

Conflict-free coloring on closed neighborhoods of bounded degree graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2020

Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

Conflict-Free Coloring on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

CoRR, 2019