Polynomial-Time Algorithm for Maximum Independent Set in Bounded-Degree Graphs With No Long Induced Claws

von Abrishami, Tara
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 2 of 5 (2022)

Induced Subgraphs of Bounded Treewidth and the Container Method

von Abrishami, Tara
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 3 of 4 (2021)