| 2013 | ||
|---|---|---|
| c19 | Hari Prabhat Gupta, S. V. Rao, T. Venkatesh: Sleep scheduling for partial coverage in heterogeneous wireless sensor networks. COMSNETS 2013: 1-10 | |
| 2012 | ||
| j7 | D. Satyanarayana, S. V. Rao: Fault-tolerant spanners for ad hoc networks. Int. Journal of Network Management 22(4): 311-329 (2012) | |
| c18 | 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: 235-242 | |
| 2011 | ||
| c17 | Prabhat Kiran, S. V. Rao: kth Order Geometric Spanners for Wireless Ad Hoc Networks. ICDCIT 2011: 197-208 | |
| c16 | Rameshwar Nath Tripathi, Shekhar Verma, S. V. Rao: Nature-Inspired Fault Tolerant Area Monitoring in Sensor Network. SocProS (1) 2011: 469-480 | |
| 2010 | ||
| c15 | 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 | |
| 2009 | ||
| j6 | 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. Geometry Appl. 19(6): 557-577 (2009) | |
| 2008 | ||
| j5 | D. Satyanarayana, S. V. Rao: Constrained Delaunay Triangulation for Ad Hoc Networks. Journal Comp. Netw. and Communic. 2008 (2008) | |
| 2007 | ||
| c14 | 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 | |
| 2006 | ||
| c13 | Winston Khoon Guan Seah, Kevin Z. Liu, Marcelo H. Ang Jr., Joo Ghee Lim, S. V. Rao: TARANTULAS: Mobility-enhanced Wireless Sensor-Actuator Networks. SUTC (1) 2006: 548-551 | |
| c12 | Eddie B. S. Tan, Joo Ghee Lim, Winston Khoon Guan Seah, S. V. Rao: On the Practical Issues in Hop Count Localization of Sensors in a Multihop Network. VTC Spring 2006: 358-362 | |
| 2005 | ||
| j4 | Alvin C. Valera, Winston Khoon Guan Seah, S. V. Rao: Improving Protocol Robustness in Ad Hoc Networks through Cooperative Packet Caching and Shortest Multipath Routing. IEEE Trans. Mob. Comput. 4(5): 443-457 (2005) | |
| c11 | ||
| c10 | B. Paul, S. V. Rao: Distributed Clustering Algorithm for Finding Virtual Backbone in Ad Hoc Networks. ICDCIT 2005: 50-55 | |
| c9 | Sau Yee Wong, Joo Ghee Lim, S. V. Rao, Winston Khoon Guan Seah: Density-aware hop-count localization (DHL) in wireless sensor networks with variable density. WCNC 2005: 1848-1853 | |
| 2004 | ||
| c8 | Randolph Tjoa, Kim Loon Chee, P. K. Sivaprasad, S. V. Rao, Joo Ghee Lim: Clock drift reduction for relative time slot TDMA-based sensor networks. PIMRC 2004: 1042-1047 | |
| 2003 | ||
| j3 | Asish Mukhopadhyay, S. V. Rao: On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geometry Appl. 13(3): 257-271 (2003) | |
| c7 | Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao: Computing the Closest Point to a Circle. CCCG 2003: 132-135 | |
| c6 | Asish Mukhopadhyay, S. V. Rao: Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) 2003: 797-806 | |
| c5 | Alvin C. Valera, Winston Khoon Guan Seah, S. V. Rao: Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc Networks. INFOCOM 2003 | |
| c4 | ||
| 2002 | ||
| c3 | Alvin C. Valera, Winston Khoon Guan Seah, S. V. Rao: CHAMP: a highly-resilient and energy-efficient routing protocol for mobile ad hoc networks. MWCN 2002: 43-47 | |
| 2001 | ||
| j2 | S. V. Rao, Asish Mukhopadhyay: Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognition 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 | ||
| 1997 | ||
| c1 | S. V. Rao, Asish Mukhopadhyay: Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC 1997: 374-383 | |
Colors in the list of coauthors
Last update Wed May 22 03:10:14 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page