Grouped domination parameterized by vertex cover, twin cover, and beyond

Cites Work

Algorithmic meta-theorems for restrictions of treewidth
Linear time solvable optimization problems on graphs of bounded clique-width
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Graph structure and monadic second-order logic. A language-theoretic approach
Easy problems for tree-decomposable graphs
Parameterized Algorithms
Deciding First-Order Properties of Nowhere Dense Graphs
Improved upper bounds for vertex cover
On the complexity of the disjoint paths problem
Algorithmic meta-theorems
Sparsity. Graphs, structures, and algorithms
Paired-domination in graphs
Title not available (Why is that?)
Dominating sets for split and bipartite graphs
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
Parameterized Algorithms for Modular-Width
Title not available (Why is that?)
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
The complexity of first-order and monadic second-order logic revisited
A survey of the algorithmic aspects of modular decomposition
Labelling algorithms for paired-domination problems in block and interval graphs
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
What makes equitable connected partition easy
Paired Domination in Graphs
Parameterized complexity of \((A,\ell)\)-path packing
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Finding a dominating set on bipartite graphs
Computing a minimum paired-dominating set in strongly orderable graphs
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Paired-domination problem on distance-hereditary graphs
Title not available (Why is that?)
Twin-width I: Tractable FO Model Checking
Complexity of paired domination in at-free and planar graphs

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)