Vertex deletion parameterized by elimination distance and even less

DOI10.1145/3406325.3451068arXiv2103.09715OpenAlexW3166550250MaRDI QIDQ6065291

Michał Włodarczyk, Bart M. P. Jansen, Jari J. H. de Kroon

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.09715

zbMATH Keywords

treewidthparameterized complexityelimination distancevertex-deletion problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (8)

Distance from triviality 2.0: hybrid parameterizations ⋮ FPT algorithms to compute the elimination distance to bipartite graphs and more ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Combing a Linkage in an Annulus ⋮ First-order Logic with Connectivity Operators ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Block elimination distance ⋮ Block elimination distance

This page was built for publication: Vertex deletion parameterized by elimination distance and even less