2 citations · 3 across the 3 of their papers we have counts for
3 papers
A Subquadratic Time Algorithm for the Weighted -Center Problem on Cactus Graphs
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
The weighted -center problem in graphs is a classical facility location problem where we place centers on the graph, which minimize the maximum weighted distance of a vertex…
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…