Gautam K. Das

Orcid: 0000-0001-7471-2885

Affiliations:
  • Indian Institute of Technology Guwahati (IITG), Department of Mathematics, Assam, India
  • University of New Brunswick, Faculty of Computer Science, Fredericton, NB, Canada
  • Indian Statistical Institute Kolkata, Advanced Computing and Microelectronics Unit, India


According to our database1, Gautam K. Das authored at least 52 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semi-total Domination in Unit Disk Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2022
On <i>d</i>-distance <i>m</i>-tuple (<i>ℓ</i>, <i>r</i>)-domination in graphs.
Inf. Process. Lett., 2022

Vertex-edge domination in unit disk graphs.
Discret. Appl. Math., 2022

2021
Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati.
Theor. Comput. Sci., 2021

The Euclidean k-supplier problem in IR2.
Oper. Res. Lett., 2021

Roman Domination in Convex Bipartite Graphs.
CoRR, 2021

Approximation Algorithms For The Dispersion Problems in a Metric Space.
CoRR, 2021

Approximation Algorithms for the Euclidean Dispersion Problems.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Total Domination in Geometric Unit Disk Graphs.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Liar's domination in unit disk graphs.
Theor. Comput. Sci., 2020

Constrained k-Center Problem on a Convex Polygon.
Int. J. Found. Comput. Sci., 2020

Capacitated discrete unit disk cover.
Discret. Appl. Math., 2020

Liar's dominating set problem on unit disk graphs.
Discret. Appl. Math., 2020

Efficient independent set approximation in unit disk graphs.
Discret. Appl. Math., 2020

Total Domination in Unit Disk Graphs.
CoRR, 2020

The Generalized Independent and Dominating Set Problems on Unit Disk Graphs.
CoRR, 2020

2019
Generalized Liar's Dominating Set in Graphs.
CoRR, 2019

2018
Discrete unit square cover problem.
Discret. Math. Algorithms Appl., 2018

Guarding Polyhedral Terrain by k-Watchtowers.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Liar's Dominating Set in Unit Disk Graphs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Distributed construction of connected dominating set in unit disk graphs.
J. Parallel Distributed Comput., 2017

Liar's Domination in 2D.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Hardness of Liar's Domination on Unit Disk Graphs.
CoRR, 2016

Improved Algorithm for Maximum Independent Set on Unit Disk Graph.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

The Euclidean k-Supplier Problem in.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
Unit disk cover problem in 2D.
J. Discrete Algorithms, 2015

Approximation algorithms for maximum independent set of a unit disk graph.
Inf. Process. Lett., 2015

Minimum Dominating Set Problem for Unit Disks Revisited.
Int. J. Comput. Geom. Appl., 2015

2013
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.
Int. J. Comput. Geom. Appl., 2013

Minimum Dominating Set for a Point Set in $\IR^2$.
CoRR, 2013

Improved Interference in Wireless Sensor Networks.
Proceedings of the Distributed Computing and Internet Technology, 2013

2012
On the discrete Unit Disk Cover Problem.
Int. J. Comput. Geom. Appl., 2012

Unit Disk Cover Problem
CoRR, 2012

2011
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.
Discret. Math. Algorithms Appl., 2010

Homogeneous 2-hop broadcast in 2D.
Comput. Geom., 2010

I/O-Efficient Rectangular Segment Search.
Proceedings of the Prodeedings of the 2010 International Conference on Computational Science and Its Applications, 2010

I/O-efficient triangular range search and its application.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Computing the straight skeleton of a monotone polygon in O(n log n) time.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Improved algorithm for the widest empty 1-corner corridor.
Inf. Process. Lett., 2009

Improved Algorithm for a Widest 1-Corner Corridor.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008
Weighted broadcast in linear radio networks.
Inf. Process. Lett., 2008

Variations of Base-Station Placement Problem on the Boundary of a Convex Region.
Int. J. Found. Comput. Sci., 2008

2007
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks.
Int. J. Found. Comput. Sci., 2007

Base Station Placement Problem on the Boundary of a Convex Region.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006
Range assignment for energy efficient broadcasting in linear radio networks.
Theor. Comput. Sci., 2006

Efficient algorithm for placing a given number of base stations to cover a convex region.
J. Parallel Distributed Comput., 2006

Homogeneous 2-Hops Broadcast in 2D.
Proceedings of the Computational Science and Its Applications, 2006

2005
Placing a Given Number of Base Stations to Cover a Convex Region.
Proceedings of the Distributed Computing, 2005

2004
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.
Proceedings of the High Performance Computing, 2004

An efficient heuristic algorithm for 2D h-hops range assignment problem.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004


  Loading...