On bounded-degree vertex deletion parameterized by treewidth
type: Item
instance of: scholarly article
title: On bounded-degree vertex deletion parameterized by treewidth
zbMATH Open document ID: 1236.05064
author: Nadja Betzler
author: Robert Bredereck
author: Rolf Niedermeier
author: Johannes Uhlmann
published in: Discrete Applied Mathematics
publication date: 2012-03-19T00:00:00Z
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6015785
zbMATH Keywords: parameterized complexity
zbMATH Keywords: structural parameterization
zbMATH Keywords: tree-likeness
zbMATH Keywords: vector dominating set
zbMATH Keywords: \(k\)-dependent set
zbMATH Keywords: co-\(k\)-plexes
MaRDI profile type: Publication
full work available at URL: j.dam.2011.08.013
OpenAlex ID: W2043193111
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
cites work: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
cites work: Parameterized complexity of candidate control in elections and related digraph problems
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: Reduction algorithms for graphs of small treewidth
cites work: A Linear Kernel for Co-Path/Cycle Packing
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4268437
cites work: Capacitated Domination and Covering: A Parameterized Perspective
cites work: Q4393480
cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
cites work: A generalization of Nemhauser and Trotter's local optimization theorem
cites work: Graph Layout Problems Parameterized by Vertex Cover
cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover
cites work: Parametrized complexity theory.
cites work: Isolation concepts for efficiently enumerating dense subgraphs
cites work: Q5710169
cites work: Reflections on Multivariate Algorithmics and Problem Parameterization
cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
cites work: Parameterized Algorithms for Generalized Domination
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: A graph‐theoretic generalization of the clique concept
DOI: 10.1016/J.DAM.2011.08.013
description: scientific article; zbMATH DE number 6015785