activity
20142022
most citedOn the minimum spanning tree problem in imprecise set-up

1 citations · 1 across the 7 of their papers we have counts for

collaborators

8 papers

cs.CG2022

Minimum color spanning circle of imprecise points

Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha +2

Let be a set of colored imprecise points, where each point is colored by one of colors. Each imprecise point is specified by a unit disk in which the point lies. W…

cs.CG2021★ 1 cited

On the minimum spanning tree problem in imprecise set-up

Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy

In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in…

cs.CG2021

Terrain prickliness: theoretical grounds for high complexity viewsheds

Ankush Acharyya, Maarten Löffler, Gert G. T. Meijer +3

An important task in terrain analysis is computing \emph{viewsheds}. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewp…

cs.DS2020

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…

cs.CC2020

Liar's Domination in Unit Disk Graphs

Ramesh K. Jallu, Sangram K. Jena, Gautam K. Das

In this article, we study a variant of the minimum dominating set problem known as the minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP-hard in un…

cs.CC2019

On -distance -tuple ()-domination in graphs

Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das

In this article, we study the -distance -tuple ()-domination problem. Given a simple undirected graph , and positive integers and , a subse…

cs.CG2016

Hardness of Liar's Domination on Unit Disk Graphs

Ramesh K Jallu, Gautam K Das

A unit disk graph is the intersection graph of a set of unit diameter disks in the plane. In this paper we consider liar's domination problem on unit disk graphs, a variant of domi…

cs.DS2014

Minimum Dominating Set for a Point Set in $\IR^2$

Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das

In this article, we consider the problem of computing minimum dominating set for a given set of points in $\IR^2$. Here the objective is to find a minimum cardinality subse…