MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal

Documenti analoghi

• Parameterized Algorithms for Editing to Uniform Cluster Graph
  di: Gaikwad, Ajinkya, et al.
  Pubblicazione: (2024)
• Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
  di: Gaikwad, Ajinkya, et al.
  Pubblicazione: (2025)
• Hardness and Tractability of T_{h+1}-Free Edge Deletion
  di: Gaikwad, Ajinkya, et al.
  Pubblicazione: (2026)
• Balanced Substructures in Bicolored Graphs
  di: Ardra, P. S., et al.
  Pubblicazione: (2024)
• The Complexity of Contracting Bipartite Graphs into Small Cycles
  di: Krithika, R., et al.
  Pubblicazione: (2022)