Grouped domination parameterized by vertex cover, twin cover, and beyond
From MaRDI portal
Publication:6131196
Recommendations
- Parameterized Complexity of Generalized Domination Problems
- Parameterized complexity of generalized domination problems
- Parameterized Algorithms for Generalized Domination
- The parameterized complexity of dominating set and friends revisited for structured graphs
- Partial vs. Complete Domination: t-Dominating Set
Cites work
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A survey of the algorithmic aspects of modular decomposition
- Algorithmic meta-theorems
- Algorithmic meta-theorems for restrictions of treewidth
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Complexity of paired domination in at-free and planar graphs
- Computing a minimum paired-dominating set in strongly orderable graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dominating sets for split and bipartite graphs
- Easy problems for tree-decomposable graphs
- Finding a dominating set on bipartite graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Improved upper bounds for vertex cover
- Labelling algorithms for paired-domination problems in block and interval graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the complexity of the disjoint paths problem
- Paired domination in graphs
- Paired-domination in graphs
- Paired-domination problem on distance-hereditary graphs
- Parameterized Algorithms for Modular-Width
- Parameterized algorithms
- Parameterized complexity of \((A,\ell)\)-path packing
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Sparsity. Graphs, structures, and algorithms
- The complexity of first-order and monadic second-order logic revisited
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Twin-width. I: Tractable FO model checking
- What makes equitable connected partition easy
This page was built for publication: Grouped domination parameterized by vertex cover, twin cover, and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131196)
