default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDD. Pushparaj Shetty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Spoorthi P. Shetty, Mangala Shetty, Vijaya Kishore, D. Pushparaj Shetty
:
Trickle timer modification for RPL in Internet of things. Soft Comput. 28(3): 2621-2635 (2024)- 2023
- [c13]Sanjay Adiwal, Balaji Rajendran, Pushparaj Shetty D, Sithu D. Sudarsan:
Health Assessment of 1485 Top Level Domain's Name Servers. COMSNETS 2023: 54-59 - [c12]Rahul Kumar Gupta, Pushparaj Shetty D:
Temporal Variability Analysis of Domain Names using Graph Techniques on Big Data. ICCCNT 2023: 1-6 - 2022
- [j13]Chandra Naik, D. Pushparaj Shetty:
Optimal sensors placement scheme for targets coverage with minimized interference using BBO. Evol. Intell. 15(3): 2115-2129 (2022) - [j12]Sanjay Adiwal, Balaji Rajendran, Pushparaj Shetty D:
A Quantitative Method for Measuring Health of Authoritative Name Servers. Int. J. Inf. Secur. Priv. 16(1): 1-19 (2022) - [j11]S. Mahadevi, Shyam S. Kamath, D. Pushparaj Shetty:
Study of novel COVID-19 data using graph energy centrality: a soft computing approach. Int. J. Medical Eng. Informatics 14(3): 282-294 (2022) - [j10]S. Mahadevi, Shyam S. Kamath, D. Pushparaj Shetty:
Graph energy centrality: a new centrality measurement based on graph energy to analyse social networks. Int. J. Web Eng. Technol. 17(2): 144-169 (2022) - [j9]Chandra Naik, D. Pushparaj Shetty:
FLAG: fuzzy logic augmented game theoretic hybrid hierarchical clustering algorithm for wireless sensor networks. Telecommun. Syst. 79(4): 559-571 (2022) - 2021
- [j8]Sanjay Adiwal, Balaji Rajendran, Pushparaj Shetty D, Gopinath Palaniappan:
Revisiting the Performance of DNS Queries on a DNS Hierarchy Testbed over Dual-Stack. Comput. J. 64(6): 843-859 (2021) - 2020
- [j7]D. Pushparaj Shetty, M. Lakshmi Prasanna:
Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks. Discret. Math. Algorithms Appl. 12(1): 2050012:1-2050012:14 (2020) - [c11]Ayan Maiti, Pushparaj Shetty D:
Indian Stock Market Prediction using Deep Learning. TENCON 2020: 1215-1220
2010 – 2019
- 2019
- [j6]D. Pushparaj Shetty, M. Lakshmi Prasanna:
Minimizing the maximum sender interference by deploying additional nodes in a wireless sensor network. Electron. J. Graph Theory Appl. 7(1): 169-182 (2019) - [j5]D. Pushparaj Shetty, M. Lakshmi Prasanna:
Approximation algorithm for receiver interference problem in dual power Wireless Sensor Networks. J. Appl. Math. Comput. 61(1-2): 87-99 (2019) - [j4]M. Lakshmi Prasanna, D. Pushparaj Shetty:
Optimal Algorithm for Minimizing Interference with Two Power Levels in Wireless Sensor Networks. J. Commun. 14(12): 1198-1204 (2019) - [c10]Purnima Nomosudro, Jyoti Mehra, Chandra Naik, D. Pushparaj Shetty:
ECABBO: Energy-efficient clustering algorithm based on Biogeography optimization for wireless sensor networks. TENCON 2019: 828-834 - 2018
- [c9]Chandra Naik, D. Pushparaj Shetty:
A Novel Meta-heuristic Differential Evolution Algorithm for Optimal Target Coverage in Wireless Sensor Networks. IBICA 2018: 83-92 - 2016
- [j3]B. S. Panda, D. Pushparaj Shetty:
Strong minimum energy hierarchical topology in wireless sensor networks. J. Comb. Optim. 32(1): 174-187 (2016) - 2015
- [j2]B. S. Panda, D. Pushparaj Shetty:
Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. J. Comb. Optim. 30(4): 1077-1094 (2015) - [c8]Nitesh Sisodiya, D. Pushparaj Shetty:
Total Power Minimization Using Dual Power Assignment in Wireless Sensor Networks. ICIT 2015: 26-30 - [c7]Bhawani Sankar Panda, D. Pushparaj Shetty, Arti Pandey:
k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT 2015: 187-192 - 2014
- [c6]Bhawani Sankar Panda, D. Pushparaj Shetty:
Minimum Range Assignment Problem for Two Connectivity in Wireless Sensor Networks. ICDCIT 2014: 122-133 - 2013
- [j1]B. S. Panda, D. Pushparaj Shetty:
Minimum interference strong bidirectional topology for wireless sensor networks. Int. J. Ad Hoc Ubiquitous Comput. 13(3/4): 243-253 (2013) - [c5]Bijaya Kishor Bhatta, D. Pushparaj Shetty:
A Parallel 2-Approximation NC-Algorithm for Range Assignment Problem in Packet Radio Networks. ICDCIT 2013: 137-144 - [c4]Bhawani Sankar Panda, D. Pushparaj Shetty:
A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT 2013: 398-409 - 2012
- [c3]Bhawani Sankar Panda, D. Pushparaj Shetty, Bijaya Kishor Bhatta:
Strong Minimum Energy Minimum Interference Topology in Wireless Sensor Networks. ICDCIT 2012: 177-187 - 2011
- [c2]B. S. Panda, D. Pushparaj Shetty:
Strong Minimum Interference Topology for Wireless Sensor Networks. ADCONS 2011: 366-374 - [c1]B. S. Panda, D. Pushparaj Shetty:
An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. ICDCIT 2011: 187-196
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 22:24 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:
