1 citations · 1 across the 6 of their papers we have counts for
6 papers
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…
Cutting a tree with Subgraph Complementation is hard, except for some small trees
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep +1
For a graph property , Subgraph Complementation to is the problem to find whether there is a subset of vertices of the input graph such that modifying by complem…
On subgraph complementation to H-free graphs
Dhanyamol Antony, Jay Garchar, Sagartanu Pal +3
For a class of graphs, the problem SUBGRAPH COMPLEMENT TO asks whether one can find a subset of vertices of the input graph such that complement…
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…
Simultaneous Consecutive Ones Submatrix and Editing Problems : Classical Complexity \& Fixed-Parameter Tractable Results
M R Rani, R Subashini, Mohith Jagalmohanan
A binary matrix has the consecutive ones property () for rows (resp. columns) if there is a permutation of its columns (resp. rows) that arranges the ones consecutively in…
-COS-R is FPT via Interval Deletion
N. S. Narayanaswamy, R. Subashini
A binary matrix has the Consecutive Ones Property (COP) if there exists a permutation of columns that arranges the ones consecutively in all the rows. Given a matrix, the -C…