S. V. Rao

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 5

Top Topics

Top Venues

Int. J. Netw. Manag.

Discret. Appl. Math.

Publications

Shubham Pandey, Preti Kumari, Hari Prabhat Gupta, S. V. Rao
Advancing LoRaWAN Network Efficiency through Dynamic Receive Window Adjustment. WCNC (2024)
Pawan K. Mishra, Sangram K. Jena, Gautam K. Das, S. V. Rao
Capacitated discrete unit disk cover. Discret. Appl. Math. 285 (2020)
Pawan K. Mishra, Sangram K. Jena, Gautam K. Das, S. V. Rao
Capacitated Discrete Unit Disk Cover. WALCOM (2019)
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
Simple, efficient location-based routing for data center network using IP address hierarchy. Int. J. Netw. Manag. 26 (6) (2016)
Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
Linear layouts of weakly triangulated graphs. Discret. Math. Algorithms Appl. 8 (3) (2016)
Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
Linear Layouts of Weakly Triangulated Graphs. WALCOM (2014)
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
Greening 4-4, 1-4 Data Center Network: A Greedy Approach for Finding an Energy Efficient Sub-network. CloudCom (2014)
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
NS3 Simulator for a Study of Data Center Networks. ISPDC (2013)
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
BCube-IP: BCube with IP Address Hierarchy. ICACNI (2013)
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
4-4, 1-4: Architecture for Data Center Network Based on IP Address Hierarchy for Efficient Routing. ISPDC (2012)
D. Satyanarayana, S. V. Rao
Fault-tolerant spanners for ad hoc networks. Int. J. Netw. Manag. 22 (4) (2012)
Prabhat Kiran, S. V. Rao
Order Geometric Spanners for Wireless Ad Hoc Networks. ICDCIT (2011)
Rameshwar Nath Tripathi, Shekhar Verma, S. V. Rao
Nature-Inspired Fault Tolerant Area Monitoring in Sensor Network. SocProS (1) (2011)
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)
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) (2009)
Rupesh Kumar, S. V. Rao
Directional Greedy Routing Protocol (DGRP) in Mobile Ad-Hoc Networks. ICIT (2008)
D. Satyanarayana, S. V. Rao
Local Delaunay Triangulation for Mobile Nodes. ICETET (2008)
D. Satyanarayana, S. V. Rao
Constrained Delaunay Triangulation for Ad Hoc Networks. J. Comput. Networks Commun. 2008 (2008)
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)
B. Paul, S. V. Rao, S. Nandi
An Efficient Distributed Algorithm for Finding Virtual Backbones in Wireless Ad-Hoc Networks. HiPC (2005)
B. Paul, S. V. Rao
Distributed Clustering Algorithm for Finding Virtual Backbone in Ad Hoc Networks. ICDCIT (2005)
Asish Mukhopadhyay, S. V. Rao
On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geom. Appl. 13 (3) (2003)
Asish Mukhopadhyay, S. V. Rao
Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) (2003)
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
Computing the Closest Point to a Circle. CCCG (2003)
S. V. Rao, Asish Mukhopadhyay
Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognit. 34 (11) (2001)
S. V. Rao, Asish Mukhopadhyay
Efficient Algorithms for Computing the beta-spectrum. CCCG (2000)
Asish Mukhopadhyay, S. V. Rao
Output-Sensitive Algorithm for Computing beta-Skeletons. Computing 65 (3) (2000)
S. V. Rao, Asish Mukhopadhyay
Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC (1997)