default search action
Sriram Bhyravarapu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]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): 2250-2288 (2024) - [j5]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
:
On locally identifying coloring of Cartesian product and tensor product of graphs. Discret. Appl. Math. 358: 429-447 (2024) - [c11]Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. SOFSEM 2024: 96-110 - 2023
- [c10]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On Locally Identifying Coloring of Graphs. CALDAM 2023: 147-158 - [c9]Sriram Bhyravarapu, I. Vinod Reddy:
On Structural Parameterizations of Star Coloring. CALDAM 2023: 159-171 - [c8]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
Dynamic Coloring on Restricted Graph Classes. CIAC 2023: 112-126 - [c7]Sriram Bhyravarapu, Satyabrata Jana
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [c6]Sriram Bhyravarapu, Satyabrata Jana
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC 2023: 5:1-5:14 - [i8]Sriram Bhyravarapu, Satyabrata Jana
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - [i7]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs. CoRR abs/2305.17536 (2023) - 2022
- [j4]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
Conflict-Free Coloring Bounds on Open Neighborhoods. Algorithmica 84(8): 2154-2185 (2022) - [j3]Sriram Bhyravarapu
A tight bound for conflict-free coloring in terms of distance to cluster. Discret. Math. 345(11): 113058 (2022) - [c5]Sriram Bhyravarapu, Satyabrata Jana
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - [c4]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. MFCS 2022: 19:1-19:14 - [i6]Sriram Bhyravarapu, I. Vinod Reddy:
On Structural Parameterizations of Star Coloring. CoRR abs/2211.12226 (2022) - 2021
- [j2]Sriram Bhyravarapu
On the tractability of (k, i)-coloring. Discret. Appl. Math. 305: 329-339 (2021) - [j1]Sriram Bhyravarapu
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. J. Graph Theory 97(4): 553-556 (2021) - [c3]Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. IWOCA 2021: 92-106 - [i5]Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. CoRR abs/2105.08693 (2021) - [i4]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-free coloring on open neighborhoods of claw-free graphs. CoRR abs/2112.12173 (2021) - 2020
- [c2]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods. WG 2020: 1-13 - [i3]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-free coloring on closed neighborhoods of bounded degree graphs. CoRR abs/2003.05637 (2020)
2010 – 2019
- 2019
- [i2]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram:
Conflict-Free Coloring on Open Neighborhoods. CoRR abs/1910.00863 (2019) - 2018
- [c1]Saurabh Joshi, Subrahmanyam Kalyanasundaram
On the Tractability of (k, i)-Coloring. CALDAM 2018: 188-198 - [i1]Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu:
On the Tractability of (k, i)-Coloring. CoRR abs/1802.03634 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: