Gautam K. Das

Publication Activity (10 Years)

Years Active: 2004-2022
Publications (10 Years): 28

Top Topics

Approximation Algorithms

Bipartite Graph

Top Venues

Discret. Appl. Math.

Publications

Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das
)-domination in graphs. Inf. Process. Lett. 174 (2022)
Sangram K. Jena, Gautam K. Das
Vertex-edge domination in unit disk graphs. Discret. Appl. Math. 319 (2022)
Sasmita Rout, Gautam K. Das
Roman Domination in Convex Bipartite Graphs. CoRR (2021)
Sangram K. Jena, Gautam K. Das
Total Domination in Geometric Unit Disk Graphs. CCCG (2021)
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Euclidean k-supplier problem in IR2. Oper. Res. Lett. 49 (1) (2021)
Pawan K. Mishra, Gautam K. Das
Approximation Algorithms For The Dispersion Problems in a Metric Space. CoRR (2021)
Pawan K. Mishra, Gautam K. Das
Approximation Algorithms for the Euclidean Dispersion Problems. CCCG (2021)
Pawan K. Mishra, Gautam K. Das
Approximation Algorithms For The Euclidean Dispersion Problems. CoRR (2021)
Ramesh K. Jallu, Gautam K. Das
Liar's dominating set problem on unit disk graphs. Discret. Appl. Math. 286 (2020)
Ramesh K. Jallu, Sangram K. Jena, Gautam K. Das
Liar's domination in unit disk graphs. Theor. Comput. Sci. 845 (2020)
Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu
Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. 280 (2020)
Sangram K. Jena, Gautam K. Das
Vertex-Edge Domination in Unit Disk Graphs. CALDAM (2020)
Ramesh K. Jallu, Sangram K. Jena, Gautam K. Das
Liar's Domination in Unit Disk Graphs. CoRR (2020)
Pawan K. Mishra, Sangram K. Jena, Gautam K. Das, S. V. Rao
Capacitated discrete unit disk cover. Discret. Appl. Math. 285 (2020)
Sangram K. Jena, Gautam K. Das
Total Domination in Unit Disk Graphs. CoRR (2020)
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das
Constrained k-Center Problem on a Convex Polygon. Int. J. Found. Comput. Sci. 31 (2) (2020)
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR (2020)
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das
Generalized Liar's Dominating Set in Graphs. CoRR (2019)
Pawan K. Mishra, Sangram K. Jena, Gautam K. Das, S. V. Rao
Capacitated Discrete Unit Disk Cover. WALCOM (2019)
Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy
Guarding Polyhedral Terrain by k-Watchtowers. FAW (2018)
Manjanna Basappa, Gautam K. Das
Discrete unit square cover problem. Discret. Math. Algorithms Appl. 10 (6) (2018)
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW (2018)
Ramesh K. Jallu, Sangram K. Jena, Gautam K. Das
Liar's Dominating Set in Unit Disk Graphs. COCOON (2018)
Ramesh K. Jallu, Gautam K. Das
Liar's Domination in 2D. CALDAM (2017)
Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das
Distributed construction of connected dominating set in unit disk graphs. J. Parallel Distributed Comput. 104 (2017)
Ramesh K. Jallu, Gautam K. Das
Improved Algorithm for Maximum Independent Set on Unit Disk Graph. CALDAM (2016)
Ramesh K. Jallu, Gautam K. Das
Hardness of Liar's Domination on Unit Disk Graphs. CoRR (2016)
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Euclidean k-Supplier Problem in. ALGOSENSORS (2016)
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das
Constrained k-Center Problem on a Convex Polygon. ICCSA (2) (2015)
Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein
Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. 25 (3) (2015)
Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay
Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115 (3) (2015)
Manjanna Basappa, Rashmisnata Acharyya, Gautam K. Das
Unit disk cover problem in 2D. J. Discrete Algorithms 33 (2015)
Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das
Minimum Dominating Set for a Point Set in $\IR^2$. CoRR (2013)
Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. 23 (6) (2013)
Pragya Agrawal, Gautam K. Das
Improved Interference in Wireless Sensor Networks. ICDCIT (2013)
Rashmisnata Acharyya, Manjanna Basappa, Gautam K. Das
Unit Disk Cover Problem in 2D. ICCSA (2) (2013)
Rashmisnata Acharyya, Manjanna Basappa, Gautam K. Das
Unit Disk Cover Problem CoRR (2012)
Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson
On the discrete Unit Disk Cover Problem. Int. J. Comput. Geom. Appl. 22 (5) (2012)
Pragya Agrawal, Gautam K. Das
Improved Interference in Wireless Sensor Networks CoRR (2012)
Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson
On the Discrete Unit Disk Cover Problem. WALCOM (2011)
Minati De, Gautam K. Das, Subhas C. Nandy
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG (2011)
Gautam K. Das, Sandip Das, Subhas C. Nandy
Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43 (2) (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)
Gautam K. Das, Bradford G. Nickerson
I/O-efficient triangular range search and its application. CCCG (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. Discret. Math. Algorithms Appl. 2 (1) (2010)
Gautam K. Das, Bradford G. Nickerson
I/O-Efficient Rectangular Segment Search. ICCSA Workshops (2010)
Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
Improved Algorithm for a Widest 1-Corner Corridor. WALCOM (2009)
Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
Improved algorithm for the widest empty 1-corner corridor. Inf. Process. Lett. 109 (18) (2009)
Gautam K. Das, Subhas C. Nandy
Weighted broadcast in linear radio networks. Inf. Process. Lett. 106 (4) (2008)
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) (2008)
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
Base Station Placement Problem on the Boundary of a Convex Region. WALCOM (2007)
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) (2007)
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 Distributed Comput. 66 (11) (2006)
Gautam K. Das, Subhas C. Nandy
Weighted Broadcast in Linear Radio Networks. AAIM (2006)
Gautam K. Das, Sandip Das, Subhas C. Nandy
Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) (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) (2006)
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)
Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. IWDC (2004)
Gautam K. Das, Sandip Das, Subhas C. Nandy
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC (2004)
Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
An efficient heuristic algorithm for 2D h-hops range assignment problem. GLOBECOM (2004)