S. Pandit

activity

20162026

most citedAsymmetric Separation Problem for Bichromatic Point Set

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.CG2016

Faster Approximation for Maximum Independent Set on Unit Disk Graph

Subhas C. Nandy, Supantha Pandit, Sasanka Roy

Maximum independent set from a given set $D$ of unit disks intersecting a horizontal line can be solved in $O (n^{2})$ time and $O (n^{2})$ space. As a corollary, we design a factor 2 ap…

cs.CG2016

Covering segments with unit squares

Ankush Acharyya, Subhas C. Nandy, Supantha Pandit +1

We study several variations of line segment covering problem with axis-parallel unit squares in $I R^{2}$ . A set $S$ of $n$ line segments is given. The objective is to find the mi…