A logic-based algorithmic meta-theorem for mim-width

DOI10.1137/1.9781611977554.CH125MaRDI QIDQ6538656zbMATH OpenFDO

Authors Benjamin Bergougnoux, Jan Dreier, Lars Jaffke

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH125

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(12)

• Conflict-free coloring: graphs of bounded clique-width and intersection graphs
• Connected feedback vertex set on AT-free graphs
• Finding induced subgraphs from graphs with small mim-width
• Stretch-width
• Structural parameterizations of b-coloring
• Comparing width parameters on graph classes
• On the parameterized complexity of computing tree-partitions
• Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard
• Tree decompositions meet induced matchings: beyond max weight independent set
• Tree decompositions meet induced matchings: beyond max weight independent set
• On algorithmic applications of \(\mathcal{F}\)-branchwidth
• Mim-width is paraNP-complete

This page was built for publication: A logic-based algorithmic meta-theorem for mim-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538656)