S. V. Rao

29 papers B 5C 3Misc 2Journal 10Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
Dispersion problem on a convex polygon.
Inf. Process. Lett.
Pawan K. Mishra, S. V. Rao, Gautam K. Das
2024 B conf
A Site-Specific LoRaWAN Parameters Selection Approach with Multi-Loss Propagation Model.
IFIP Networking
Shubham Pandey, Preti Kumari, Hari Prabhat Gupta, Devashish Rai, S. V. Rao
2024 B conf
Advancing LoRaWAN Network Efficiency through Dynamic Receive Window Adjustment.
WCNC
Shubham Pandey, Preti Kumari, Hari Prabhat Gupta, S. V. Rao
2020 J jnl
Capacitated discrete unit disk cover.
Discret. Appl. Math.
Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao
2019 B conf
Capacitated Discrete Unit Disk Cover.
WALCOM
Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao
2016 J jnl
Linear layouts of weakly triangulated graphs.
Discret. Math. Algorithms Appl.
Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
2016 J jnl
Simple, efficient location-based routing for data center network using IP address hierarchy.
Int. J. Netw. Manag.
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
2014 C conf
Greening 4-4, 1-4 Data Center Network: A Greedy Approach for Finding an Energy Efficient Sub-network.
CloudCom
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
2014 B conf
Linear Layouts of Weakly Triangulated Graphs.
WALCOM
Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli
2013 — conf
BCube-IP: BCube with IP Address Hierarchy.
ICACNI
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
2013 C conf
NS3 Simulator for a Study of Data Center Networks.
ISPDC
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
2012 C conf
4-4, 1-4: Architecture for Data Center Network Based on IP Address Hierarchy for Efficient Routing.
ISPDC
A. R. Ashok Kumar, S. V. Rao, Diganta Goswami
2012 J jnl
Fault-tolerant spanners for ad hoc networks.
Int. J. Netw. Manag.
D. Satyanarayana, S. V. Rao
2011 — conf
Nature-Inspired Fault Tolerant Area Monitoring in Sensor Network.
SocProS (1)
Rameshwar Nath Tripathi, Shekhar Verma, S. V. Rao
2010 — conf
Computing the straight skeleton of a monotone polygon in O(n log n) time.
CCCG
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao
2009 J jnl
On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area.
Int. J. Comput. Geom. Appl.
Asish Mukhopadhyay, Eugene Greene, S. V. Rao
2008 J jnl
Constrained Delaunay Triangulation for Ad Hoc Networks.
J. Comput. Networks Commun.
D. Satyanarayana, S. V. Rao
2008 — conf
Directional Greedy Routing Protocol (DGRP) in Mobile Ad-Hoc Networks.
ICIT
Rupesh Kumar, S. V. Rao
2008 — conf
Local Delaunay Triangulation for Mobile Nodes.
ICETET
D. Satyanarayana, S. V. Rao
2007 — conf
On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area.
ICCSA (1)
Asish Mukhopadhyay, Eugene Greene, S. V. Rao
2005 Misc conf
An Efficient Distributed Algorithm for Finding Virtual Backbones in Wireless Ad-Hoc Networks.
HiPC
B. Paul, S. V. Rao, S. Nandi
2005 Misc conf
Distributed Clustering Algorithm for Finding Virtual Backbone in Ad Hoc Networks.
ICDCIT
B. Paul, S. V. Rao
2003 — conf
Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation.
ICCSA (3)
Asish Mukhopadhyay, S. V. Rao
2003 — conf
Computing the Closest Point to a Circle.
CCCG
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
2003 J jnl
On Computing a Largest Empty Arbitrarily Oriented Rectangle.
Int. J. Comput. Geom. Appl.
Asish Mukhopadhyay, S. V. Rao
2001 J jnl
Fast algorithms for computing Beta-skeletons and their relatives.
Pattern Recognit.
S. V. Rao, Asish Mukhopadhyay
2000 — conf
Efficient Algorithms for Computing the beta-spectrum.
CCCG
S. V. Rao, Asish Mukhopadhyay
2000 J jnl
Output-Sensitive Algorithm for Computing beta-Skeletons.
Computing
Asish Mukhopadhyay, S. V. Rao
1997 B conf
Fast Algorithms for Computing beta-Skeletons and Their Relatives.
ISAAC
S. V. Rao, Asish Mukhopadhyay