Faster parameterized algorithms for modification problems to minor-closed classes

Documenti analoghi

• Graph modification of bounded size to minor-closed classes as fast as vertex deletion
  di: Morelle, Laure, et al.
  Pubblicazione: (2025)
• Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
  di: Sau, Ignasi, et al.
  Pubblicazione: (2024)
• Vertex identification to a forest
  di: Morelle, Laure, et al.
  Pubblicazione: (2024)
• Dynamic programming on bipartite tree decompositions
  di: Jaffke, Lars, et al.
  Pubblicazione: (2023)
• Finding irrelevant vertices in linear time on bounded-genus graphs
  di: Golovach, Petr A., et al.
  Pubblicazione: (2019)