On algorithmic applications of F-branchwidth

DOI10.4230/LIPICS.ESA.2025.16MaRDI QIDQ7322402zbMATH OpenFDO

Authors Benjamin Bergougnoux, Thekla Hamm, Lars Jaffke, Paloma T. Lima

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.16

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• k-Degenerate Graphs
• A logic-based algorithmic meta-theorem for mim-width
• Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
• FO model checking of interval graphs
• Graph classes with structured neighborhoods and algorithmic applications
• scientific article; zbMATH DE number 7829295 (Why is no real title available?)
• More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• On the hardness of generalized domination problems parameterized by mim-width
• On the tractability of optimization problems on \(H\)-graphs
• Parameterized algorithms
• The grid theorem for vertex-minors
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Tight lower bounds for problems parameterized by rank-width
• Twin-width. I: Tractable FO model checking

Cited in

(1)

• Hamiltonicity parameterized by mim-width Is (indeed) para-NP-hard

This page was built for publication: On algorithmic applications of \(\mathcal{F}\)-branchwidth

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