Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDP. Venkata Subba Reddy 0001
Person information
- affiliation: National Institute of Technology, Warangal, Department of Computer Science and Engineering, India
Other persons with the same name
- P. Venkata Subba Reddy 0002 (aka: Poli Venkata Subba Reddy) — Sri Venkateswara University College of Engineering, Department of Computer Science and Engineering, Tirupati, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j11]Chakradhar Padamutham
, P. Venkata Subba Reddy, Khandelwal Himanshu:
Algorithmic complexity of weakly connected Roman domination in graphs. Discret. Math. Algorithms Appl. 14(3): 2150125:1-2150125:14 (2022)- [j10]Amit Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam:
Algorithmic aspects of outer independent Roman domination in graphs. Discret. Math. Algorithms Appl. 14(5): 2250004:1-2250004:8 (2022) - [j9]Chakradhar Padamutham, P. Venkata Subba Reddy:
Algorithmic aspects of Roman {3}-domination in graphs. RAIRO Oper. Res. 56(4): 2277-2291 (2022) - 2021
- [j8]Chakradhar Padamutham, Venkata Subba Reddy Palagiri:
Algorithmic aspects of total Roman {3}-domination in graphs. Discret. Math. Algorithms Appl. 13(5): 2150063:1-2150063:14 (2021) - [j7]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy:
Algorithmic aspects of secure connected domination in graphs. Discuss. Math. Graph Theory 41(4): 1179-1197 (2021) - [j6]Amit Sharma, P. Venkata Subba Reddy:
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs. Int. J. Found. Comput. Sci. 32(3): 331-339 (2021) - [j5]Jakkepalli Pavan Kumar, Venkata Subba Reddy Palagiri:
Algorithmic aspects of 2-secure domination in graphs. J. Comb. Optim. 42(1): 56-70 (2021) - 2020
- [j4]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam:
Algorithmic complexity of secure connected domination in graphs. AKCE Int. J. Graphs Comb. 17(3): 1010-1013 (2020) - [j3]Chakradhar Padamutham, Venkata Subba Reddy Palagiri:
Complexity of Roman {2}-domination and the double Roman domination in graphs. AKCE Int. J. Graphs Comb. 17(3): 1081-1086 (2020) - [j2]Chakradhar Padamutham, Venkata Subba Reddy Palagiri:
Algorithmic aspects of Roman domination in graphs. J. Appl. Math. Comput. 64(1-2): 89-102 (2020) - 2017
- [j1]Devendra Lad, P. Venkata Subba Reddy, Jakkepalli Pavan Kumar:
Complexity Issues of Variants of Secure Domination in Graphs. Electron. Notes Discret. Math. 63: 77-84 (2017)
Conference and Workshop Papers
- 2021
- [c2]Chakradhar Padamutham, Venkata Subba Reddy Palagiri:
Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs. CALDAM 2021: 32-42 - 2015
- [c1]U. S. N. Raju, K. V. Kadambari, P. Venkata Subba Reddy:
A new method of assessing the students using video assignments. EDUCON 2015: 771-773
Informal and Other Publications
- 2023
- [i6]Sanath Kumar Vengaldas, Adarsh Reddy Muthyala, Bharath Chaitanya Konkati, P. Venkata Subba Reddy:
Integer Linear Programming Formulations for Triple and Quadruple Roman Domination Problems. CoRR abs/2305.00730 (2023) - 2020
- [i5]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy:
Algorithmic Aspects of Secure Connected Domination in Graphs. CoRR abs/2001.11250 (2020) - [i4]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy:
Algorithmic Aspects of Some Variants of Domination in Graphs. CoRR abs/2002.00002 (2020) - [i3]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam:
Algorithmic Complexity of Secure Connected Domination in Graphs. CoRR abs/2002.00713 (2020) - [i2]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy:
Algorithmic Aspects of 2-Secure Domination in Graphs. CoRR abs/2002.02408 (2020) - [i1]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy:
Algorithmic Complexity of Isolate Secure Domination in Graphs. CoRR abs/2002.05538 (2020)
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-04-25 01:52 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:
