N. Aravind

activity

20142026

most citedAlgorithms and hardness results for happy coloring problems

15 citations · 20 across the 14 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

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…

cs.DS2021★ 1 cited

An FPT algorithm for Matching Cut and d-cut

N R Aravind, Roopam Saxena

Given a positive integer $d$ , the d-CUT is the problem of deciding if an undirected graph $G = (V, E)$ has a cut $(A, B)$ such that every vertex in $A$ (resp. $B$ ) has at most $d$ neig…