1 citations · 1 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi
The class of graph deletion problems has been extensively studied in theoretical computer science, particularly in the field of parameterized complexity. Recently, a new notion of…
cs.DS2024
Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar +2
We consider structural parameterizations of the fundamental Dominating Set problem and its variants in the parameter ecology program. We give improved FPT algorithms and lower boun…