An efficient heuristic algorithm for 2D h-hops range assignment problem. - Gautam K. Das; Sasthi C. Ghosh 001; Subhas C. Nandy (GLOBECOM, 2004)

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (HiPC, 2004)

Placing a Given Number of Base Stations to Cover a Convex Region. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy; Bhabani P. Sinha (IWDC, 2005)

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

Efficient algorithm for placing a given number of base stations to cover a convex region. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy; Bhabani P. Sinha (J. Parallel Distributed Comput., 2006)

Range assignment for energy efficient broadcasting in linear radio networks. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (Theor. Comput. Sci., 2006)

Base Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (WALCOM, 2007)

Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. - Gautam K. Das; Sasthi C. Ghosh 001; Subhas C. Nandy (Int. J. Found. Comput. Sci., 2007)

Variations of Base-Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (Int. J. Found. Comput. Sci., 2008)

Weighted broadcast in linear radio networks. - Gautam K. Das; Subhas C. Nandy (Inf. Process. Lett., 2008)

Improved Algorithm for a Widest 1-Corner Corridor. - Gautam K. Das; Debapriyay Mukhopadhyay; Subhas C. Nandy (WALCOM, 2009)

Improved algorithm for the widest empty 1-corner corridor. - Gautam K. Das; Debapriyay Mukhopadhyay; Subhas C. Nandy (Inf. Process. Lett., 2009)

Computing the straight skeleton of a monotone polygon in O(n log n) time. - Gautam K. Das; Asish Mukhopadhyay; Subhas C. Nandy; Sangameswar Patil; S. V. Rao 001 (CCCG, 2010)

I/O-efficient triangular range search and its application. - Gautam K. Das; Bradford G. Nickerson (CCCG, 2010)

I/O-Efficient Rectangular Segment Search. - Gautam K. Das; Bradford G. Nickerson (ICCSA Workshops, 2010)

Homogeneous 2-hop broadcast in 2D. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2010)

An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. - Francisco Claude; Gautam K. Das; Reza Dorrigiv; Stephane Durocher; Robert Fraser; Alejandro López-Ortiz; Bradford G. Nickerson; Alejandro Salinger (Discret. Math. Algorithms Appl., 2010)

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

Unit Disk Cover Problem - Rashmisnata Acharyya; Manjanna Basappa; Gautam K. Das (CoRR, 2012)

On the discrete Unit Disk Cover Problem. - Gautam K. Das; Robert Fraser; Alejandro López-Ortiz; Bradford G. Nickerson (Int. J. Comput. Geom. Appl., 2012)

Improved Interference in Wireless Sensor Networks. - Pragya Agrawal; Gautam K. Das (ICDCIT, 2013)

Minimum Dominating Set for a Point Set in $ IR^2$. - Ramesh K. Jallu; Prajwal R. Prasad; Gautam K. Das (CoRR, 2013)

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. - Minati De; Gautam K. Das; Paz Carmi; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2013)

Minimum Dominating Set Problem for Unit Disks Revisited. - Paz Carmi; Gautam K. Das; Ramesh K. Jallu; Subhas C. Nandy; Prajwal R. Prasad; Yael Stein (Int. J. Comput. Geom. Appl., 2015)

Approximation algorithms for maximum independent set of a unit disk graph. - Gautam K. Das; Minati De; Sudeshna Kolay; Subhas C. Nandy; Susmita Sur-Kolay (Inf. Process. Lett., 2015)

Unit disk cover problem in 2D. - Manjanna Basappa; Rashmisnata Acharyya; Gautam K. Das (J. Discrete Algorithms, 2015)

The Euclidean k-Supplier Problem in. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (ALGOSENSORS, 2016)

Improved Algorithm for Maximum Independent Set on Unit Disk Graph. - Ramesh K. Jallu; Gautam K. Das (CALDAM, 2016)

Hardness of Liar's Domination on Unit Disk Graphs. - Ramesh K. Jallu; Gautam K. Das (CoRR, 2016)

Liar's Domination in 2D. - Ramesh K. Jallu; Gautam K. Das (CALDAM, 2017)

Distributed construction of connected dominating set in unit disk graphs. - Ramesh K. Jallu; Prajwal R. Prasad; Gautam K. Das (J. Parallel Distributed Comput., 2017)

Liar's Dominating Set in Unit Disk Graphs. - Ramesh K. Jallu; Sangram Kishor Jena; Gautam K. Das (COCOON, 2018)

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (FAW, 2018)

Guarding Polyhedral Terrain by k-Watchtowers. - Nitesh Tripathi; Manjish Pal; Minati De; Gautam K. Das; Subhas C. Nandy (FAW, 2018)

Discrete unit square cover problem. - Manjanna Basappa; Gautam K. Das (Discret. Math. Algorithms Appl., 2018)

Generalized Liar's Dominating Set in Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das (CoRR, 2019)

The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (CoRR, 2020)

Total Domination in Unit Disk Graphs. - Sangram Kishor Jena; Gautam K. Das (CoRR, 2020)

Efficient independent set approximation in unit disk graphs. - Gautam K. Das; Guilherme Dias da Fonseca; Ramesh K. Jallu (Discret. Appl. Math., 2020)

Liar's dominating set problem on unit disk graphs. - Ramesh K. Jallu; Gautam K. Das (Discret. Appl. Math., 2020)

Capacitated discrete unit disk cover. - Pawan K. Mishra; Sangram Kishor Jena; Gautam K. Das; S. V. Rao 001 (Discret. Appl. Math., 2020)

Constrained k-Center Problem on a Convex Polygon. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das (Int. J. Found. Comput. Sci., 2020)

Liar's domination in unit disk graphs. - Ramesh K. Jallu; Sangram Kishor Jena; Gautam K. Das (Theor. Comput. Sci., 2020)

Total Domination in Geometric Unit Disk Graphs. - Sangram Kishor Jena; Gautam K. Das (CCCG, 2021)

Approximation Algorithms for the Euclidean Dispersion Problems. - Pawan K. Mishra; Gautam K. Das (CCCG, 2021)

Approximation Algorithms For The Dispersion Problems in a Metric Space. - Pawan K. Mishra; Gautam K. Das (CoRR, 2021)

Roman Domination in Convex Bipartite Graphs. - Sasmita Rout; Gautam K. Das (CoRR, 2021)

The Euclidean k-supplier problem in IR2. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (Oper. Res. Lett., 2021)

Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati. - Gautam Kumar Das; Subhas C. Nandy; M. Sohel Rahman (Theor. Comput. Sci., 2021)

Vertex-edge domination in unit disk graphs. - Sangram Kishor Jena; Gautam K. Das (Discret. Appl. Math., 2022)

On d-distance m-tuple (ℓ, r)-domination in graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das (Inf. Process. Lett., 2022)

Semi-total Domination in Unit Disk Graphs. - Sasmita Rout; Gautam Kumar Das (CALDAM, 2024)

(Independent) Roman Domination Parameterized by Distance to Cluster. - Pradeesha Ashok; Gautam K. Das; Arti Pandey; Kaustav Paul; Subhabrata Paul (COCOA (2), 2024)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs. - Sasmita Rout; Gautam Kumar Das (CoRR, 2024)

Dispersion problem on a convex polygon. - Pawan K. Mishra; S. V. Rao 001; Gautam K. Das (Inf. Process. Lett., 2025)