SIAM Journal on Computing
The extremal function for complete minors
Journal of Combinatorial Theory Series B
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Backdoor Sets for DLL Subsolvers
Journal of Automated Reasoning
Machine-based methods in parameterized complexity theory
Theoretical Computer Science
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The parameterized complexity of regular subgraph problems and generalizations
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 5.23 |
We examine the parameterized complexity of the problem of editing a graph to obtain an r-degenerate graph. We show that for the editing operations vertex deletion and edge deletion, both separately and combined, the problem is W[P]-complete, and remains W[P]-complete even if the input graph is already (r+1)-degenerate, or has maximum degree 2r+1 for all r=2. We also demonstrate fixed-parameter tractability for several Clique based problems when the input graph has bounded degeneracy.