The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Reduction algorithms for graphs of small treewidth
Information and Computation
The Maximum k-Dependent and f-Dependent Set Problem
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
Parameterized Algorithms for Generalized Domination
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Graph Layout Problems Parameterized by Vertex Cover
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science
Parameterized complexity of candidate control in elections and related digraph problems
Theoretical Computer Science
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
Combinatorial Algorithms
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A linear kernel for co-path/cycle packing
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Parameterized Complexity
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.04 |
Given an undirected graph G and an integer d=0, the NP-hard Bounded-Degree Vertex Deletion problem asks to delete as few vertices as possible from G such that the resulting graph has maximum vertex degree d. Our main result is to prove that Bounded-Degree Vertex Deletion is W[1]-hard with respect to the parameter treewidth. As a side result, we obtain that the NP-hard Vector Dominating Set problem is W[1]-hard with respect to the parameter treewidth. On the positive side, we show that Bounded-Degree Vertex Deletion becomes fixed-parameter tractable when parameterized by the combined parameter treewidth and number of vertices to delete, and when parametrized by the feedback edge set number.