default search action
S. V. Rao 0001
Person information
- affiliation: Indian Institute of Technology Guwahati, Department of Computer Science and Engineering, Assam, India
Other persons with the same name
- S. V. Rao 0002
(aka: S. Viswanatha Rao) — Mar Baselios College of Engineering and Technology, Thiruvananthapuram, India (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j26]Pawan K. Mishra
Dispersion problem on a convex polygon. Inf. Process. Lett. 187: 106498 (2025) - 2024
- [c30]Shubham Pandey, Preti Kumari, Hari Prabhat Gupta, Devashish Rai, S. V. Rao:
A Site-Specific LoRaWAN Parameters Selection Approach with Multi-Loss Propagation Model. IFIP Networking 2024: 350-358 - [c29]Shubham Pandey, Preti Kumari, Hari Prabhat Gupta, S. V. Rao:
Advancing LoRaWAN Network Efficiency through Dynamic Receive Window Adjustment. WCNC 2024: 1-6 - 2021
- [j25]Debanjan Sadhukhan
Minimizing Critical Event Delay and Maximizing Lifetime in a Hybrid Data-Gathering Protocol for WSNs. Wirel. Pers. Commun. 118(1): 1-17 (2021) - 2020
- [j24]Balaprakasa Rao Killi, Seela Veerabhadreswara Rao:
Poly-stable matching based scalable controller placement with balancing constraints in SDN. Comput. Commun. 154: 82-91 (2020) - [j23]Pawan K. Mishra
Capacitated discrete unit disk cover. Discret. Appl. Math. 285: 242-251 (2020) - [j22]Debanjan Sadhukhan
Energy efficient multi-beacon guard method for periodic data gathering in time-synchronized WSN. Wirel. Networks 26(7): 5337-5354 (2020)
2010 – 2019
- 2019
- [j21]Bala Prakasa Rao Killi
Towards improving resilience of controller placement with minimum backup capacity in software defined networks. Comput. Networks 149: 102-114 (2019) - [j20]Bala Prakasa Rao Killi
Controller placement in software defined networks: A Comprehensive survey. Comput. Networks 163 (2019) - [j19]Debanjan Sadhukhan
Minimum cost event driven WSN with spatial differentiated QoS requirements. Wirel. Networks 25(7): 3899-3915 (2019) - [c28]Pawan K. Mishra
Capacitated Discrete Unit Disk Cover. WALCOM 2019: 407-418 - 2018
- [j18]Bala Prakasa Rao Killi
On Placement of Hypervisors and Controllers in Virtualized Software Defined Network. IEEE Trans. Netw. Serv. Manag. 15(2): 840-853 (2018) - [c27]Bala Prakasa Rao Killi, Ellore Akhil Reddy, Seela Veerabhadreswara Rao:
Cooperative game theory based network partitioning for controller placement in SDN. COMSNETS 2018: 105-112 - [c26]Bala Prakasa Rao Killi, Ellore Akhil Reddy, Seela Veerabhadreswara Rao:
Game Theory Based Network Partitioning Approaches for Controller Placement in SDN. COMSNETS (Extended Selected Papers) 2018: 245-267 - [c25]Bala Prakasa Rao Killi, Seela Veerabhadreswara Rao:
Link failure aware capacitated controller placement in software defined networks. ICOIN 2018: 292-297 - 2017
- [j17]Hari Prabhat Gupta
Analysis of Coverage Under Border Effects in Three-Dimensional Mobile Sensor Networks. IEEE Trans. Mob. Comput. 16(9): 2436-2449 (2017) - [j16]Bala Prakasa Rao Killi
Capacitated Next Controller Placement in Software Defined Networks. IEEE Trans. Netw. Serv. Manag. 14(3): 514-527 (2017) - [j15]Debanjan Sadhukhan
Effect of Clock Skew in Event Driven, Delay Constrained Heterogeneous WSN with Anycast. Wirel. Pers. Commun. 97(4): 4967-4980 (2017) - [c24]Rishi Sharma, Ranu Vikram, Bala Prakasa Rao Killi, Seela Veerabhadreswara Rao:
CO2 Penalty and Disaster Aware Data Center and Service Placement for Cost Minimization. ICDCIT 2017: 94-104 - 2016
- [j14]Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli:
Linear layouts of weakly triangulated graphs. Discret. Math. Algorithms Appl. 8(3): 1650038:1-1650038:21 (2016) - [j13]Bala Prakasa Rao Killi, Seela Veerabhadreswara Rao:
Optimal Model for Failure Foresight Capacitated Controller Placement in Software-Defined Networks. IEEE Commun. Lett. 20(6): 1108-1111 (2016) - [j12]A. R. Ashok Kumar
Simple, efficient location-based routing for data center network using IP address hierarchy. Int. J. Netw. Manag. 26(6): 492-514 (2016) - [j11]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Analysis of stochastic coverage and connectivity in three-dimensional heterogeneous directional wireless sensor networks. Pervasive Mob. Comput. 29: 38-56 (2016) - [j10]Hari Prabhat Gupta, Seela Veerabhadreswara Rao:
Demand-Based Coverage and Connectivity-Preserving Routing in Wireless Sensor Networks. IEEE Syst. J. 10(4): 1380-1389 (2016) - [j9]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Sleep Scheduling Protocol for k-Coverage of Three-Dimensional Heterogeneous WSNs. IEEE Trans. Veh. Technol. 65(10): 8423-8431 (2016) - [c23]Bala Prakasa Rao Killi, Seela Veerabhadreswara Rao:
Controller placement with planning for failures in software defined networks. ANTS 2016: 1-6 - [c22]Debanjan Sadhukhan, Seela Veerabhadreswara Rao:
Critical Sensor Density for Event-Driven Data-Gathering in Delay and Lifetime Constrained WSN. WWIC 2016: 309-320 - 2015
- [j8]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Venkatesh Tamarapalli
Analysis of Stochastic k-Coverage and Connectivity in Sensor Networks With Boundary Deployment. IEEE Trans. Intell. Transp. Syst. 16(4): 1861-1871 (2015) - 2014
- [j7]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Critical Sensor Density for Partial Coverage under Border Effects in Wireless Sensor Networks. IEEE Trans. Wirel. Commun. 13(5): 2374-2382 (2014) - [c21]A. R. Ashok Kumar
Greening 4-4, 1-4 Data Center Network: A Greedy Approach for Finding an Energy Efficient Sub-network. CloudCom 2014: 869-874 - [c20]Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli:
Linear Layouts of Weakly Triangulated Graphs. WALCOM 2014: 322-336 - [c19]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Analysis of stochastic k-coverage in wireless sensor networks with boundary deployment. WCNC 2014: 2629-2634 - 2013
- [c18]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Critical sensor density for fault-tolerant coverage in 3D heterogeneous wireless sensor networks. IEEE ANTS 2013: 1-6 - [c17]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Sleep scheduling for partial coverage in heterogeneous wireless sensor networks. COMSNETS 2013: 1-10 - [c16]A. R. Ashok Kumar
BCube-IP: BCube with IP Address Hierarchy. ICACNI 2013: 319-326 - [c15]Hari Prabhat Gupta, Seela Veerabhadreswara Rao, Tamarapalli Venkatesh:
Analysis of the redundancy in coverage of a heterogeneous wireless sensor network. ICC 2013: 1904-1909 - [c14]A. R. Ashok Kumar
NS3 Simulator for a Study of Data Center Networks. ISPDC 2013: 224-231 - 2012
- [j6]D. Satyanarayana, S. V. Rao:
Fault-tolerant spanners for ad hoc networks. Int. J. Netw. Manag. 22(4): 311-329 (2012) - [c13]A. R. Ashok Kumar
4-4, 1-4: Architecture for Data Center Network Based on IP Address Hierarchy for Efficient Routing. ISPDC 2012: 235-242 - 2011
- [c12]Prabhat Kiran, S. V. Rao:
kth Order Geometric Spanners for Wireless Ad Hoc Networks. ICDCIT 2011: 197-208 - [c11]Rameshwar Nath Tripathi, Shekhar Verma
Nature-Inspired Fault Tolerant Area Monitoring in Sensor Network. SocProS (1) 2011: 469-480 - 2010
- [c10]Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao:
Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207-210
2000 – 2009
- 2009
- [j5]Asish Mukhopadhyay, Eugene Greene, S. V. Rao:
On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. Int. J. Comput. Geom. Appl. 19(6): 557-577 (2009) - 2008
- [j4]D. Satyanarayana, S. V. Rao:
Constrained Delaunay Triangulation for Ad Hoc Networks. J. Comput. Networks Commun. 2008: 160453:1-160453:10 (2008) - [c9]Rupesh Kumar, S. V. Rao:
Directional Greedy Routing Protocol (DGRP) in Mobile Ad-Hoc Networks. ICIT 2008: 183-188 - [c8]D. Satyanarayana, S. V. Rao:
Local Delaunay Triangulation for Mobile Nodes. ICETET 2008: 282-287 - 2007
- [c7]Asish Mukhopadhyay, Eugene Greene, S. V. Rao:
On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. ICCSA (1) 2007: 41-54 - 2005
- [c6]B. Paul, S. V. Rao, S. Nandi:
An Efficient Distributed Algorithm for Finding Virtual Backbones in Wireless Ad-Hoc Networks. HiPC 2005: 302-311 - [c5]B. Paul, S. V. Rao:
Distributed Clustering Algorithm for Finding Virtual Backbone in Ad Hoc Networks. ICDCIT 2005: 50-55 - 2003
- [j3]Asish Mukhopadhyay, S. V. Rao:
On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geom. Appl. 13(3): 257-271 (2003) - [c4]Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao:
Computing the Closest Point to a Circle. CCCG 2003: 132-135 - [c3]Asish Mukhopadhyay, S. V. Rao:
Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) 2003: 797-806 - 2001
- [j2]S. V. Rao, Asish Mukhopadhyay:
Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognit. 34(11): 2163-2172 (2001) - 2000
- [j1]Asish Mukhopadhyay, S. V. Rao:
Output-Sensitive Algorithm for Computing beta-Skeletons. Computing 65(3): 285-289 (2000) - [c2]S. V. Rao, Asish Mukhopadhyay:
Efficient Algorithms for Computing the beta-spectrum. CCCG 2000
1990 – 1999
- 1997
- [c1]S. V. Rao, Asish Mukhopadhyay:
Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC 1997: 374-383
Coauthor Index
aka: Balaprakasa Rao Killi
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-23 21:27 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: