Gautam K. Das

Pragya Agrawal, Gautam K. Das: Improved Interference in Wireless Sensor Networks. ICDCIT 2013: 92-102

Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson: On the discrete Unit Disk Cover Problem. Int. J. Comput. Geometry Appl. 22(5): 407-420 (2012)

Pragya Agrawal, Gautam K. Das: Improved Interference in Wireless Sensor Networks. CoRR abs/1207.5708 (2012)

Rashmisnata Acharyya, Manjanna B., Gautam K. Das: Unit Disk Cover Problem. CoRR abs/1209.2951 (2012)

Minati De, Gautam K. Das, Subhas C. Nandy: Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011

Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson: On the Discrete Unit Disk Cover Problem. WALCOM 2011: 146-157

Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010)

Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, Alejandro Salinger: An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. Discrete Math., Alg. and Appl. 2(1): 77-88 (2010)

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

Gautam K. Das, Bradford G. Nickerson: I/O-efficient triangular range search and its application. CCCG 2010: 245-248

Gautam K. Das, Bradford G. Nickerson: I/O-Efficient Rectangular Segment Search. ICCSA Workshops 2010: 61-67

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)

Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy: Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92

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)

Gautam K. Das, Subhas C. Nandy: Weighted broadcast in linear radio networks. Inf. Process. Lett. 106(4): 136-143 (2008)

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)

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

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)

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)

Gautam K. Das, Subhas C. Nandy: Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343-353

Gautam K. Das, Sandip Das, Subhas C. Nandy: Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759

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

Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy: An efficient heuristic algorithm for 2D h-hops range assignment problem. GLOBECOM 2004: 1051-1055

Gautam K. Das, Sandip Das, Subhas C. Nandy: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429

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