11 citations · 18 across the 6 of their papers we have counts for
6 papers · 1 filter
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
Madhura Dutta, Anil Maheshwari, Subhas C. Nandy +1
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least…
Faster Approximation for Maximum Independent Set on Unit Disk Graph
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Maximum independent set from a given set of unit disks intersecting a horizontal line can be solved in time and space. As a corollary, we design a factor 2 ap…
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 in , where each point is ass…
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 . A set of line segments is given. The objective is to find the mi…
Space-efficient Algorithms for Visibility Problems in Simple Polygon
Minati De, Anil Maheshwari, Subhas C. Nandy
Given a simple polygon consisting of vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside ,…
Querying for the Largest Empty Geometric Object in a Desired Location
John Augustine, Sandip Das, Anil Maheshwari +3
We study new types of geometric query problems defined as follows: given a geometric set , preprocess it such that given a query point , the location of the largest circle th…