On bounded-degree vertex deletion parameterized by treewidth
From MaRDI portal
(Redirected from Publication:765338)
Recommendations
- On structural parameterizations of the bounded-degree vertex deletion problem
- On structural parameterizations of the bounded-degree vertex deletion problem
- A parameterized algorithm for bounded-degree vertex deletion
- Losing Treewidth by Separating Subsets
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
Cites work
- scientific article; zbMATH DE number 1354124 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- 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
- A partial k-arboretum of graphs with bounded treewidth
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- Capacitated Domination and Covering: A Parameterized Perspective
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. II. Algorithmic aspects of tree-width
- Isolation concepts for efficiently enumerating dense subgraphs
- Kernelization: new upper and lower bound techniques
- On making a distinguished vertex minimum degree by vertex deletion
- Parameterized Algorithms for Generalized Domination
- Parameterized complexity of candidate control in elections and related digraph problems
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Parametrized complexity theory.
- Reduction algorithms for graphs of small treewidth
- Reflections on multivariate algorithmics and problem parameterization
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
Cited in
(36)- On making a distinguished vertex minimum degree by vertex deletion
- Studies in Computational Aspects of Voting
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Grundy Distinguishes Treewidth from Pathwidth
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- Maximum weight t-sparse set problem on vector-weighted graphs
- Trimming weighted graphs of bounded treewidth
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
- Approximating power node-deletion problems
- Approximating power node-deletion problems
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
- (Total) vector domination for graphs with bounded branchwidth
- Subexponential fixed-parameter algorithms for partial vector domination
- scientific article; zbMATH DE number 7236457 (Why is no real title available?)
- Approximating bounded degree deletion via matroid matching
- Complexity and kernels for bipartition into degree-bounded induced graphs
- On structural parameterizations of the bounded-degree vertex deletion problem
- Approximating partially bounded degree deletion on directed graphs
- Parameterized orientable deletion
- Parameterized orientable deletion
- Subexponential fixed-parameter algorithms for partial vector domination
- Complexity and kernels for bipartition into degree-bounded induced graphs
- Hitting forbidden subgraphs in graphs of bounded treewidth
- On the parameterized complexity of maximum degree contraction problem
- Grundy distinguishes treewidth from pathwidth
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- Structural parameterizations for two bounded degree problems revisited
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs
- Tree-edges deletion problems with bounded diameter obstruction sets
- Kernels for packing and covering problems
- On structural parameterizations of the bounded-degree vertex deletion problem
- Latency-bounded target set selection in social networks
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- A parameterized algorithm for bounded-degree vertex deletion
- On making a distinguished vertex of minimum degree by vertex deletion
This page was built for publication: On bounded-degree vertex deletion parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765338)
