Satyabrata Jana

activity

20162026

most citedUniquely Restricted Matchings in Interval Graphs

4 citations · 4 across the 10 of their papers we have counts for

collaborators

Showing cs.CGShow all

4 papers · 1 filter

cs.CG2026

Witness Set: A Visibility Problem in $N P \cap X P$

Satyabrata Jana, Debabrata Pal, Bodhayan Roy +1

We study the Witness Set problem, a natural dual to the classical Art Gallery problem. In the Witness Set problem, we are given a polygon $P$ and an integer $k$ as input, and the o…

cs.CG2025

Witness Set in Monotone Polygons: Exact and Approximate

Udvas Das, Binayak Dutta, Satyabrata Jana +2

Given a simple polygon $P$ , two points $x$ and $y$ within $P$ are {\em visible} to each other if the line segment between $x$ and $y$ is contained in $\mathscr{…

cs.CG2019

Linear Size Planar Manhattan Network for Convex Point Sets

Satyabrata Jana, Anil Maheshwari, Sasanka Roy

Let $G = (V, E)$ be an edge-weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge $uv \in E$ is its length. Let $W_{G} (u, v)$ denote the len…

cs.CG2018

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…

Witness Set: A Visibility Problem in NP∩XP

Witness Set in Monotone Polygons: Exact and Approximate

Linear Size Planar Manhattan Network for Convex Point Sets

Covering and Packing of Rectilinear Subdivision

Witness Set: A Visibility Problem in $N P \cap X P$