3 citations · 7 across the 4 of their papers we have counts for
4 papers
The RED-BLUE SEPARATION problem on graphs
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud +2
We introduce the Red-Blue Separation problem on graphs, where we are given a graph whose vertices are colored either red or blue, and we want to select a (small) subset $…
Monitoring edge-geodetic sets in graphs
Subhadeep R. Dev, Sanjana Dey, Florent Foucaud +2
We introduce a new graph-theoretic concept in the area of network monitoring. In this area, one wishes to monitor the vertices and/or the edges of a network (viewed as a graph) in…
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…