scientific article; zbMATH DE number 7788454

DOI10.5555/3458064.3458180MaRDI QIDQ6147372zbMATH OpenFDO

Authors Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski, Paul Seymour

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2003.05185

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(9)

• Treewidth versus clique number. II: Tree-independence number
• Classifying subset feedback vertex set for \(H\)-free graphs
• Induced subgraphs of bounded treewidth and the container method
• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
• Connected feedback vertex set on AT-free graphs
• Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument
• Tree decompositions meet induced matchings: beyond max weight independent set
• Improved algorithms for perfect graphs and odd holes
• Graphs with no long claws: an improved bound for the analog of the Gyárfás' path argument

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147372)