G. Das

activity

20122026

most citedUnit Disk Cover Problem

8 citations · 10 across the 11 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Roman Domination in Convex Bipartite Graphs

Sasmita Rout, Gautam K. Das

In the Roman domination problem, an undirected simple graph $G (V, E)$ is given. The objective of Roman domination problem is to find a function $f : V \to {0, 1, 2}$ such tha…

cs.CG2021★ 1 cited

Approximation Algorithms For The Dispersion Problems in a Metric Space

Pawan K. Mishra, Gautam K. Das

In this article, we consider the $c$ -dispersion problem in a metric space $(X, d)$ . Let $P = {p_{1}, p_{2}, \dots, p_{n}}$ be a set of $n$ points in a metric space $(X, d)$ . For eac…

cs.CG2021

Approximation Algorithms For The Euclidean Dispersion Problems

Pawan K. Mishra, Gautam K. Das

In this article, we consider the Euclidean dispersion problems. Let $P = {p_{1}, p_{2}, \dots, p_{n}}$ be a set of $n$ points in $R^{2}$ . For each point $p \in P$ and $S \s…