On structural parameterizations of the bounded-degree vertex deletion problem
From MaRDI portal
Recommendations
- On structural parameterizations of the bounded-degree vertex deletion problem
- On bounded-degree vertex deletion parameterized by treewidth
- A parameterized algorithm for bounded-degree vertex deletion
- Approximating bounded degree deletion via matroid matching
- Approximating partially bounded degree deletion on directed graphs
Cites work
- A complete parameterized complexity analysis of bounded planning
- A generalization of Nemhauser and Trotter's local optimization theorem
- A graph‐theoretic generalization of the clique concept
- A linear kernel for co-path/cycle packing
- Algorithmic applications of tree-cut width
- Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
- Backdoors into heterogeneous classes of SAT and CSP
- Clique relaxations in social network analysis: the maximum k-plex problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 1989615 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Immersions in highly edge connected graphs
- Integer Programming with a Fixed Number of Variables
- Isolation concepts for efficiently enumerating dense subgraphs
- Kernelization using structural parameters on sparse graph classes
- Meta-kernelization using Well-structured Modulators
- Meta-kernelization with structural parameters
- On bounded-degree vertex deletion parameterized by treewidth
- Parameterized algorithms
- Reduction algorithms for graphs of small treewidth
- Solving problems on graphs of high rank-width
- Sparsity. Graphs, structures, and algorithms
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The multidimensional 0-1 knapsack problem: an overview.
- The structure of graphs not admitting a fixed immersion
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
Cited in
(22)- Approximating partially bounded degree deletion on directed graphs
- On structural parameterizations of the edge disjoint paths problem
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
- On structural parameterizations of the bounded-degree vertex deletion problem
- The power of cut-based parameters for computing edge-disjoint paths
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- A parameterized algorithm for bounded-degree vertex deletion
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- Group activity selection with few agent types
- Grundy Distinguishes Treewidth from Pathwidth
- scientific article; zbMATH DE number 7236457 (Why is no real title available?)
- Approximating partially bounded degree deletion on directed graphs
- Approximating bounded degree deletion via matroid matching
- On making a distinguished vertex of minimum degree by vertex deletion
- Grundy distinguishes treewidth from pathwidth
- Exploring the gap between treedepth and vertex cover through vertex integrity
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- Structural parameterizations for two bounded degree problems revisited
- On bounded-degree vertex deletion parameterized by treewidth
- On the parameterized complexity of maximum degree contraction problem
This page was built for publication: On structural parameterizations of the bounded-degree vertex deletion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304132)
