Journal of Combinatorial Theory Series B
The complexity of regular subgraph recognition
Discrete Applied Mathematics - Computational combinatiorics
Journal of Combinatorial Theory Series B
Deciding whether a planar graph has a cubic subgraph is NP-complete
Discrete Mathematics
Finding regular subgraphs in both arbitrary and planar graphs
Discrete Applied Mathematics
On locating cubic subgraphs in bounded-degree connected bipartite graphs
Discrete Mathematics
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On the fixed-parameter tractability of parameterized model-checking problems
Information Processing Letters
The parameterized complexity of regular subgraph problems and generalizations
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Parameterized Graph Editing with Chosen Vertex Degrees
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Finding a Δ-regular supergraph of minimum order
Discrete Applied Mathematics
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Kernels: annotated, proper and induced
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
A refined complexity analysis of degree anonymization in graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We study a wide class of graph editing problems that ask whether a given graph can be modified to satisfy certain degree constraints, using a limited number of vertex deletions, edge deletions, or edge additions. The problems generalize several well-studied problems such as the General Factor Problem and the Regular Subgraph Problem. We classify the parameterized complexity of the considered problems taking upper bounds on the number of editing steps and the maximum degree of the resulting graph as parameters.