Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Documenti analoghi

• Path Contraction Faster than $2^n$
  di: Agrawal, Akanksha, et al.
  Pubblicazione: (2025)
• A Finer View of the Parameterized Landscape of Labeled Graph Contractions
  di: Mathur, Yashaswini, et al.
  Pubblicazione: (2025)
• A Single Exponential-Time FPT Algorithm for Cactus Contraction
  di: Krithika, R., et al.
  Pubblicazione: (2025)
• Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
  di: Marx, Dániel, et al.
  Pubblicazione: (2026)
• FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
  di: Bandyapadhyay, Sayan, et al.
  Pubblicazione: (2023)