3 citations · 7 across the 4 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
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.CG2020★ 3 cited
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…