Documenti analoghi

• Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
  di: Galby, Esther, et al.
  Pubblicazione: (2024)
• Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
  di: Galby, Esther, et al.
  Pubblicazione: (2025)
• On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
  di: Munaro, Andrea, et al.
  Pubblicazione: (2022)
• Computing Tree Decompositions with Small Independence Number
  di: Dallard, Clément, et al.
  Pubblicazione: (2022)
• Solving Problems on Generalized Convex Graphs via Mim-Width
  di: Bonomo-Braberman, Flavia, et al.
  Pubblicazione: (2020)