List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs

Documenti analoghi

• Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2024)
• Generalized Graph Packing Problems Parameterized by Treewidth
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2025)
• Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2022)
• Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
  di: Focke, Jacob, et al.
  Pubblicazione: (2023)
• List Locally Surjective Homomorphisms in Hereditary Graph Classes
  di: Dvořák, Pavel, et al.
  Pubblicazione: (2022)