Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.
Extended MSO model checking via small vertex integrity
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
Fair MSO1 problems are W[1]-hard parameterized by cluster vertex deletion in general, but admit FPT algorithms under a sufficient condition that includes fair feedback vertex set, vertex cover, dominating set, and odd cycle transversal.
citing papers explorer
-
Computing Twin-Width via Treedepth and Vertex Integrity
Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.
-
Fair Vertex Problems Parameterized by Cluster Vertex Deletion
Fair MSO1 problems are W[1]-hard parameterized by cluster vertex deletion in general, but admit FPT algorithms under a sufficient condition that includes fair feedback vertex set, vertex cover, dominating set, and odd cycle transversal.