@inproceedings{57e2229800754b6e9677a792e3dcb64c,
title = "Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS",
abstract = "In the Directed Feedback Vertex Set (DFVS) problem, given a digraph D and k∈ N, the goal is to check if there exists a set of at most k vertices whose deletion from D leaves a directed acyclic graph. Resolving the existence of a polynomial kernel for DFVS parameterized by the solution size k is a central open problem in Kernelization. In this paper, we give a polynomial kernel for DFVS parameterized by k plus the size of a treewidth- η modulator. Our choice of parameter strictly encompasses previous positive kernelization results on DFVS. Our main result is based on a novel application of the tool of important separators embedded in state-of-the-art machinery such as protrusion decompositions.",
keywords = "DFVS, Important separator, Kernel, Treewidth",
author = "Daniel Lokshtanov and Ramanujan, {M. S.} and Saket Saurabh and Roohani Sharma and Meirav Zehavi",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 16th International Symposium on Algorithms and Data Structures, WADS 2019 ; Conference date: 05-08-2019 Through 07-08-2019",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-24766-9_38",
language = "English",
isbn = "9783030247652",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "523--537",
editor = "Zachary Friggstad and Salavatipour, {Mohammad R.} and J{\"o}rg-R{\"u}diger Sack",
booktitle = "Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings",
address = "Germany",
}