2 papers
cs.CG2022
On the Parameterized Complexity of the Maximum Exposure Problem
Remi Raman, Shahin John J S, R Subashini +1
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P) where R is the set of ranges containing a set P of points, and an integer…
cs.CG2019
Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems
Remi Raman, R Subashini, Subhasree Methirumangalath
Given an orthogonal connected arrangement of line-segments, Minimum Corridor Guarding(MCG) problem asks for an optimal tree/closed walk such that, if a guard moves through the tree…