Roopam Saxena

activity

20212024

most citedAn FPT algorithm for Matching Cut and d-cut

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024

The Parameterized Complexity of Terminal Monitoring Set

N. R. Aravind, Roopam Saxena

In Terminal Monitoring Set (TMS), the input is an undirected graph $G = (V, E)$ , together with a collection $T$ of terminal pairs and the goal is to find a subset $S$ of minimum size…

cs.DM2021

Perfectly Matched Sets in Graphs: Parameterized and Exact Computation

N. R. Aravind, Roopam Saxena

In an undirected graph $G = (V, E)$ , we say $(A, B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$ ) has exactly one…