|
Search the dblp DataBase
Gautam K. Das:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Gautam K. Das, Subhas C. Nandy
Weighted Broadcast in Linear Radio Networks. [Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:343-353 [Conf]
- Gautam K. Das, Sandip Das, Subhas C. Nandy
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. [Citation Graph (0, 0)][DBLP] HiPC, 2004, pp:420-429 [Conf]
- Gautam K. Das, Sandip Das, Subhas C. Nandy
Homogeneous 2-Hops Broadcast in 2D. [Citation Graph (0, 0)][DBLP] ICCSA (2), 2006, pp:750-759 [Conf]
- Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
Placing a Given Number of Base Stations to Cover a Convex Region. [Citation Graph (0, 0)][DBLP] IWDC, 2005, pp:57-62 [Conf]
- Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. [Citation Graph (0, 0)][DBLP] IWDC, 2004, pp:412-423 [Conf]
- Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
Base Station Placement Problem on the Boundary of a Convex Region. [Citation Graph (0, 0)][DBLP] WALCOM, 2007, pp:151-152 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2006, v:66, n:11, pp:1353-1358 [Journal]
- Gautam K. Das, Sandip Das, Subhas C. Nandy
Range assignment for energy efficient broadcasting in linear radio networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:332-341 [Journal]
Computing the straight skeleton of a monotone polygon in O(n log n) time. [Citation Graph (, )][DBLP]
I/O-efficient triangular range search and its application. [Citation Graph (, )][DBLP]
Improved Algorithm for a Widest 1-Corner Corridor. [Citation Graph (, )][DBLP]
Homogeneous 2-hop broadcast in 2D. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|