 | 2009 |
| 13 |  | Gautam K. Das,
Debapriyay Mukhopadhyay,
Subhas C. Nandy:
Improved Algorithm for a Widest 1-Corner Corridor.
WALCOM 2009: 83-92 |
| 12 |  | Gautam K. Das,
Debapriyay Mukhopadhyay,
Subhas C. Nandy:
Improved algorithm for the widest empty 1-corner corridor.
Inf. Process. Lett. 109(18): 1060-1065 (2009) |
| 2008 |
| 11 |  | Gautam K. Das,
Subhas C. Nandy:
Weighted broadcast in linear radio networks.
Inf. Process. Lett. 106(4): 136-143 (2008) |
| 10 |  | Gautam K. Das,
Sasanka Roy,
Sandip Das,
Subhas C. Nandy:
Variations of Base-Station Placement Problem on the Boundary of a Convex Region.
Int. J. Found. Comput. Sci. 19(2): 405-427 (2008) |
| 2007 |
| 9 |  | Gautam K. Das,
Sasanka Roy,
Sandip Das,
Subhas C. Nandy:
Base Station Placement Problem on the Boundary of a Convex Region.
WALCOM 2007: 151-152 |
| 8 |  | Gautam K. Das,
Sasthi C. Ghosh,
Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks.
Int. J. Found. Comput. Sci. 18(3): 619-635 (2007) |
| 2006 |
| 7 |  | Gautam K. Das,
Subhas C. Nandy:
Weighted Broadcast in Linear Radio Networks.
AAIM 2006: 343-353 |
| 6 |  | Gautam K. Das,
Sandip Das,
Subhas C. Nandy:
Homogeneous 2-Hops Broadcast in 2D.
ICCSA (2) 2006: 750-759 |
| 5 |  | Gautam K. Das,
Sandip Das,
Subhas C. Nandy,
Bhabani P. Sinha:
Efficient algorithm for placing a given number of base stations to cover a convex region.
J. Parallel Distrib. Comput. 66(11): 1353-1358 (2006) |
| 4 |  | Gautam K. Das,
Sandip Das,
Subhas C. Nandy:
Range assignment for energy efficient broadcasting in linear radio networks.
Theor. Comput. Sci. 352(1-3): 332-341 (2006) |
| 2005 |
| 3 |  | Gautam K. Das,
Sandip Das,
Subhas C. Nandy,
Bhabani P. Sinha:
Placing a Given Number of Base Stations to Cover a Convex Region.
IWDC 2005: 57-62 |
| 2004 |
| 2 |  | Gautam K. Das,
Sandip Das,
Subhas C. Nandy:
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.
HiPC 2004: 420-429 |
| 1 |  | Gautam K. Das,
Sasthi C. Ghosh,
Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks.
IWDC 2004: 412-423 |