On the hardness of generalized domination problems parameterized by mim-width
From MaRDI portal
Cites work
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Bounding the mim‐width of hereditary graph classes
- Can you beat treewidth?
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Fundamentals of parameterized complexity
- Graph classes with structured neighborhoods and algorithmic applications
- scientific article; zbMATH DE number 7829295 (Why is no real title available?)
- List k-colouring P_t-free graphs: a mim-width perspective
- Mim-width. I. Induced path problems
- Mim-width. II. The feedback vertex set problem
- Mim-width. III. Graph powers and generalized distance domination problems
- More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- On the clique-width of some perfect graph classes
- On the complexity of k-SAT
- On the hardness of generalized domination problems parameterized by mim-width
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the tractability of optimization problems on \(H\)-graphs
- Parameterized algorithms
- Parameterized complexity of generalized domination problems
- Parameterized problems complete for nondeterministic FPT time and logarithmic space
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Solving problems on generalized convex graphs via mim-width
- Some simplified NP-complete graph problems
- The Complexity of Coloring Circular Arcs and Chords
- Twin-width. I: Tractable FO model checking
- XNLP-completeness for parameterized problems on graphs with a linear structure
Cited in
(2)
This page was built for publication: On the hardness of generalized domination problems parameterized by mim-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969010)
