1 citations · 1 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
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.DS2022
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…