Parameterized complexity of odd domination and its generalization
From MaRDI portal
Cites work
- A parameterized perspective of \textsc{all-colors}
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- A Survey of the Game “Lights Out!”
- Can you beat treewidth?
- Combinatorial properties of a general domination problem with parity constraints
- Deciding first-order properties of nowhere dense graphs
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Hard tiling problems with simple tiles
- scientific article; zbMATH DE number 4114031 (Why is no real title available?)
- Kernelization Lower Bounds by Cross-Composition
- Kernelization lower bounds through colors and IDs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Mim-width. III. Graph powers and generalized distance domination problems
- On nowhere dense graphs
- On the complexity of dominating set problems related to the minimum all-ones problem
- Parameterized algorithms
- Parameterized complexity of generalized domination problems
- Practical algorithms on partial k-trees with an application to domination-like problems
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Residue domination in bounded-treewidth graphs
- Solutions to all-colors problem on graph cellular automata
- The σ-Game and Cellular Automata
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
This page was built for publication: Parameterized complexity of odd domination and its generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442699)