Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems

Documenti analoghi

• On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
  di: Bandopadhyay, Susobhan, et al.
  Pubblicazione: (2026)
• A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
  di: Jacob, Ashwin, et al.
  Pubblicazione: (2026)
• A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
  di: Jacob, Ashwin, et al.
  Pubblicazione: (2024)
• Deterministic Minimum Steiner Cut in Maximum Flow Time
  di: Ding, Matthew, et al.
  Pubblicazione: (2023)
• An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
  di: Ibrahimpur, Sharat, et al.
  Pubblicazione: (2025)