Sasanka Roy

activity

20082026

most citedLargest Empty Circle Centered on a Query Line

11 citations · 35 across the 18 of their papers we have counts for

collaborators

Showing 2016Show all

4 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

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle

Ankush Acharyya, Subhas C. Nandy, Sasanka Roy

In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points $P = {p_{1}, p_{2}, \dots, p_{n}}$ in $I R^{2}$ , where each point is ass…

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…

cs.CG2016

Problems on One Way Road Networks

Jammigumpula Ajaykumar, Avinandan Das, Navaneeta Saikia +1

Let $O W R N = ⟨ W_{x}, W_{y} ⟩$ be a One Way Road Network where $W_{x}$ and $W_{y}$ are the sets of directed horizontal and vertical roads respectively. $O W R N$ can be c…