20 citations · 54 across the 21 of their papers we have counts for
24 papers
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy +1
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least…
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
Aritra Banik, Sayani Das, Anil Maheshwari +6
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph , consisting of a vertex set of size and an edge set .…
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…
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
Sanjana Dey, Florent Foucaud, Subhas C Nandy +1
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points and a finite set of objects are give…
Sparsity of weighted networks: measures and applications
Swati Goswami, Asit K. Das, Subhas C. Nandy
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, o…
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…