On structural parameterizations of the bounded-degree vertex deletion problem
From MaRDI portal
Publication:2223699
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
- An application of simultaneous diophantine approximation in combinatorial optimization
- Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoors to planning
- 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
- Graph Layout Problems Parameterized by Vertex Cover
- scientific article; zbMATH DE number 1354124 (Why is no real title available?)
- scientific article; zbMATH DE number 2001186 (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 Lower Bounds by Cross-Composition
- Kernelization using structural parameters on sparse graph classes
- Meta-kernelization using Well-structured Modulators
- Meta-kernelization with structural parameters
- Minkowski's Convex Body Theorem and Integer Programming
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On bounded-degree vertex deletion parameterized by treewidth
- On making a distinguished vertex of minimum degree by vertex deletion
- On structural parameterizations of the bounded-degree vertex deletion problem
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Parameterized algorithms
- Parameterized complexity of candidate control in elections and related digraph problems
- Reduction algorithms for graphs of small treewidth
- SAT-encodings for treecut width and treedepth
- 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 power of cut-based parameters for computing edge disjoint paths
- The structure of graphs not admitting a fixed immersion
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
Cited in
(37)- Approximating partially bounded degree deletion on directed graphs
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- On structural parameterizations of the offensive alliance problem
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- Group activity selection with few agent types
- A parameterized algorithm for bounded-degree vertex deletion
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- On structural parameterizations of the bounded-degree vertex deletion problem
- Algorithmic applications of tree-cut width
- Approximating partially bounded degree deletion on directed graphs
- Approximating bounded degree deletion via matroid matching
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- Hedonic diversity games: a complexity picture with more than two colors
- Parameterized intractability of defensive alliance problem
- Extended MSO model checking via small vertex integrity
- Slim tree-cut width
- Structural parameterizations for two bounded degree problems revisited
- Core stability in additively separable hedonic games of low treewidth
- Structural parameterization of minus domination
- Slim tree-cut width
- Structural parameterization of minus domination
- Structural parameterizations of the biclique-free vertex deletion problem
- Structural parameterizations for two bounded degree problems revisited
- Fine-grained meta-theorems for vertex integrity
- Algorithms and complexity of difference logic
- Parameterized vertex integrity revisited
- Twin-width meets feedback edges and vertex integrity
- Parameterised distance to local irregularity
- Parameterised distance to local irregularity
- Fantastic flips and where to find them: a general framework for parameterized local search on partitioning problems
- Linear layouts revisited: stacks, queues, and exact algorithms
- The parameter report: an orientation guide for data-driven parameterization
- On bounded-degree vertex deletion parameterized by treewidth
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 Q2223699)
