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

Cites Work

Sparsity. Graphs, structures, and algorithms
A survey of the algorithmic aspects of modular decomposition
Improved upper bounds for vertex cover
Dominating sets for split and bipartite graphs
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
Finding a dominating set on bipartite graphs
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
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Computing a minimum paired-dominating set in strongly orderable graphs
Algorithmic meta-theorems for restrictions of treewidth
The complexity of first-order and monadic second-order logic revisited
Linear time solvable optimization problems on graphs of bounded clique-width
Paired-domination problem on distance-hereditary graphs
Parameterized complexity of \((A,\ell)\)-path packing
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
On the complexity of the disjoint paths problem
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Parameterized Algorithms for Modular-Width
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
Easy problems for tree-decomposable graphs
Paired Domination in Graphs
What Makes Equitable Connected Partition Easy
Paired-domination in graphs
Deciding First-Order Properties of Nowhere Dense Graphs
Twin-width I: Tractable FO Model Checking
Parameterized Algorithms
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Complexity of paired domination in at-free and planar graphs
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item

This page was built for publication: Grouped domination parameterized by vertex cover, twin cover, and beyond