Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern

Documenti analoghi

• Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2024)
• Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern
  di: Hörsch, Florian, 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)
• From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
  di: Frei, Fabian, et al.
  Pubblicazione: (2025)
• List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2022)