Generalized Graph Packing Problems Parameterized by Treewidth

Documenti analoghi

• Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2024)
• List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2022)
• Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2022)
• The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
  di: Greilhuber, Jakob, et al.
  Pubblicazione: (2025)
• Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
  di: Focke, Jacob, et al.
  Pubblicazione: (2022)