Parameterized complexity of paired domination
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Automata, Languages and Programming
- Combinatorial bounds via measure and conquer
- Complexity of paired domination in AT-free and planar graphs
- Domination problems in nowhere-dense classes of graphs
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Faster algorithms on branch and clique decompositions
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Known algorithms on graphs of bounded treewidth are probably optimal
- Labelling algorithms for paired-domination problems in block and interval graphs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Paired domination in graphs: a survey and recent results
- Paired-domination in graphs
- Parameterized algorithms
- Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond
- Polynomial-time data reduction for dominating set
- STACS 2005
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Structures of domination in graphs
- Topics in Domination in Graphs
This page was built for publication: Parameterized complexity of paired domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021066)
