8 citations · 10 across the 11 of their papers we have counts for
12 papers
Algorithms for the Maximum Edge Open Packing Problem
Sriram Bhyravarapu, Gautam K. Das, Kamal Santra
Packing problems form a central theme in graph theory, owing to their relevance in modeling conflict-free resource allocation, network design, and communication constraints. Motiva…
Roman Domination in Convex Bipartite Graphs
Sasmita Rout, Gautam K. Das
In the Roman domination problem, an undirected simple graph is given. The objective of Roman domination problem is to find a function such tha…
Approximation Algorithms For The Dispersion Problems in a Metric Space
Pawan K. Mishra, Gautam K. Das
In this article, we consider the -dispersion problem in a metric space . Let be a set of points in a metric space . For eac…
Approximation Algorithms For The Euclidean Dispersion Problems
Pawan K. Mishra, Gautam K. Das
In this article, we consider the Euclidean dispersion problems. Let be a set of points in . For each point and $S \s…
Total Domination in Unit Disk Graphs
Sangram K. Jena, Gautam K. Das
Let be an undirected graph. We call as a total dominating set (TDS) of if each vertex has a dominator in other than itself. Here we co…
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das +1
In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum -distance independent set problem and the…