1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…