1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
Maximum-width Axis-Parallel Empty Rectangular Annulus
Arpita Baral, Abhilash Gondane, Sanjib Sadhu +1
Given a set of points on , we address the problem of computing an axis-parallel empty rectangular annulus of maximum-width such that no point of lies…
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…
Approximation algorithms for the two-center problem of convex polygon
Sanjib Sadhu, Sasanka Roy, Soumen Nandi +2
Given a convex polygon with vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover . We propose an algo…