Generalized graph packing problems parameterized by treewidth

DOI10.4230/LIPICS.ESA.2025.3MaRDI QIDQ7322387zbMATH OpenFDO

Authors Barış Can Esmer, Dániel Marx

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.3

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
• Fundamental problems on bounded-treewidth graphs: the real source of hardness
• scientific article; zbMATH DE number 7651213 (Why is no real title available?)
• Title not available (Why is no real title available?)
• Known algorithms on graphs of bounded treewidth are probably optimal
• List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
• On generalized matching problems
• Parameterized algorithms
• Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
• Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus

This page was built for publication: Generalized graph packing problems parameterized by treewidth

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