default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDI. Vinod Reddy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]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)- [j7]I. Vinod Reddy
:
On structural parameterizations of load coloring. Discret. Appl. Math. 342: 181-189 (2024) - [j6]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) - 2023
- [c15]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On Locally Identifying Coloring of Graphs. CALDAM 2023: 147-158 - [c14]Sriram Bhyravarapu, I. Vinod Reddy:
On Structural Parameterizations of Star Coloring. CALDAM 2023: 159-171 - [c13]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
Dynamic Coloring on Restricted Graph Classes. CIAC 2023: 112-126 - [i12]Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs. CoRR abs/2305.17536 (2023) - [i11]Harshit Kumar Choudhary, I. Vinod Reddy:
On Color Critical Graphs of Star Coloring. CoRR abs/2305.17956 (2023) - 2022
- [i10]Sriram Bhyravarapu, I. Vinod Reddy:
On Structural Parameterizations of Star Coloring. CoRR abs/2211.12226 (2022) - 2021
- [c12]I. Vinod Reddy:
On Structural Parameterizations of Load Coloring. CALDAM 2021: 109-121 - [c11]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 - [i9]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) - 2020
- [j5]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. Theor. Comput. Sci. 819: 9-23 (2020) - [j4]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy:
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - [c10]Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad:
Evolution of Physics Sub-fields. COMPLEXIS 2020: 88-95 - [i8]I. Vinod Reddy:
On Structural Parameterizations of Load Coloring. CoRR abs/2010.05186 (2020)
2010 – 2019
- 2019
- [j3]Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura:
On structural parameterizations of firefighting. Theor. Comput. Sci. 782: 79-90 (2019) - [c9]Anjeneya Swami Kare, I. Vinod Reddy:
Parameterized Algorithms for Graph Burning Problem. IWOCA 2019: 304-314 - [i7]I. Vinod Reddy:
Parameterized Coloring Problems on Threshold Graphs. CoRR abs/1910.10364 (2019) - 2018
- [j2]Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, I. Vinod Reddy:
On NC algorithms for problems on bounded rank-width graphs. Inf. Process. Lett. 139: 64-67 (2018) - [j1]I. Vinod Reddy:
Parameterized algorithms for conflict-free colorings of graphs. Theor. Comput. Sci. 745: 53-62 (2018) - [c8]Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. CALDAM 2018: 221-234 - [c7]Jayesh Choudhari, I. Vinod Reddy:
On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. WALCOM 2018: 228-239 - [c6]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. WALCOM 2018: 252-264 - 2017
- [c5]Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM 2017: 118-129 - [c4]Neeldhara Misra, I. Vinod Reddy:
The Parameterized Complexity of Happy Colorings. IWOCA 2017: 142-153 - [i6]Neeldhara Misra, I. Vinod Reddy:
The Parameterized Complexity of Happy Colorings. CoRR abs/1708.03853 (2017) - [i5]I. Vinod Reddy:
Parameterized Algorithms for Conflict-free Colorings of Graphs. CoRR abs/1710.00223 (2017) - [i4]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. CoRR abs/1711.08885 (2017) - [i3]Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. CoRR abs/1711.10227 (2017) - 2016
- [c3]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. COCOON 2016: 55-66 - 2015
- [c2]Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad:
Does Diversity of Papers Affect Their Citations? Evidence from American Physical Society Journals. SITIS 2015: 505-511 - [c1]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. WALCOM 2015: 329-334 - [i2]Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3. CoRR abs/1506.01695 (2015) - [i1]Murali Krishna Enduri, I. Vinod Reddy, Shivakumar Jolad:
Does diversity of papers affect their citations? Evidence from American Physical Society Journals. CoRR abs/1512.05057 (2015)
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 2025-01-21 00:10 CET 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:
