11 citations · 35 across the 18 of their papers we have counts for
25 papers
Polynomial-time algorithm for exact -center problem under continuous Fréchet distance
Soumya Bhattacharya, Serene Rasheed, Sasanka Roy
In this paper, we explore the -center problem for polygonal curves under continuous Fréchet distance. The -center problem, in general, is known to be NP-hard. Aron…
Witness Set in Monotone Polygons: Exact and Approximate
Udvas Das, Binayak Dutta, Satyabrata Jana +2
Given a simple polygon , two points and within are {\em visible} to each other if the line segment between and is contained in $\mathscr{…
Constant Delay Lattice Train Schedules
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari +2
The following geometric vehicle scheduling problem has been considered: given continuous curves , find non-negative delays $…
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74
Sanjib Sadhu, Xiaozhou He, Sasanka Roy +2
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is propos…
Linear Size Planar Manhattan Network for Convex Point Sets
Satyabrata Jana, Anil Maheshwari, Sasanka Roy
Let be an edge-weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge is its length. Let denote the len…
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…