1 citations · 1 across the 8 of their papers we have counts for
13 papers
Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center
Nandana Ghosh, Ankush Acharyya, Rakesh Gupta +1
We study exact one-center optimization for axis-parallel segments using axis-parallel squares under endpoint-based coverage, where a segment is \emph{-covered} if the square con…
Location-Aware Dispersion on Anonymous Graphs
Himani, Supantha Pandit, Gokarna Sharma
The well-studied DISPERSION problem is a fundamental coordination problem in distributed robotics, where a set of mobile robots must relocate so that each occupies a distinct node…
Hardness and Approximation Schemes for Discrete Packing and Domination
Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit
We present polynomial-time approximation schemes based on local search} technique for both geometric (discrete) independent set (\mdis) and geometric (discrete) dominating set (\md…
Optimal Dispersion of Silent Robots in a Ring
Bibhuti Das, Barun Gorain, Kaushik Mondal +2
Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, w…
Asymmetric Separation Problem for Bichromatic Point Set
Sukanya Maji, Supantha Pandit, Sanjib Sadhu
We study the Generalized Red-Blue Annulus Cover problem for two sets of points, red () and blue (), where each point is associated with a positive penalty ${\…
Collaborative Dispersion by Silent Robots
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal +1
In the dispersion problem, a set of co-located mobile robots must relocate themselves in distinct nodes of an unknown network. The network is modeled as an anonymous graph $G=(…
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
Barun Gorain, Kaushik Mondal, Himadri Nayak +1
We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node of degree are labeled arbitrarily as…
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
Sujoy Bhore, Satyabrata Jana, Supantha Pandit +1
We study the Balanced Connected Subgraph(shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Gi…
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…
The Balanced Connected Subgraph Problem
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana +3
The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we…
Covering and Packing of Rectilinear Subdivision
Satyabrata Jana, Supantha Pandit
We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision wi…
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…
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…