6 citations · 9 across the 8 of their papers we have counts for
9 papers · 1 filter
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…
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74
Sanjib Sadhu, Xiaozhou He, Sasanka Roy +2
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is propos…
Variations of largest rectangle recognition amidst a bichromatic point set
Ankush Acharyya, Minati De, Subhas C. Nandy +1
Classical separability problem involving multi-color point sets is an important area of study in computational geometry. In this paper, we study different separability problems for…
Color spanning Localized query
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q…
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy +1
This paper discusses the problem of covering and hitting a set of line segments in by a pair of axis-parallel squares such that the side length of the larg…
The Runaway Rectangle Escape Problem
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan +3
Motivated by the applications of routing in PCB buses, the Rectangle Escape Problem was recently introduced and studied. In this problem, we are given a set of rectangles $\mathcal…