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 2014Show all

2 papers · 1 filter

cs.DS2014

On Polynomial Kernelization of $H$ -free Edge Deletion

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

For a set of graphs $H$ , the \textsc{ $H$ -free Edge Deletion} problem asks to find whether there exist at most $k$ edges in the input graph whose deletion result…

math.CO2014

The chromatic discrepancy of graphs

N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep +1

For a proper vertex coloring $c$ of a graph $G$ , let $φ_{c} (G)$ denote the maximum, over all induced subgraphs $H$ of $G$ , the difference between the chromatic number $χ (H)$ and the…

On Polynomial Kernelization of H-free Edge Deletion

The chromatic discrepancy of graphs

On Polynomial Kernelization of $H$ -free Edge Deletion