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)

Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths

von Pilipczuk, Marcin
Veröffentlicht in SIAM Symposium on Simplicity in Algorithms (4. : 2021 : Online) Fourth Symposium on Simplicity in Algorithms (SOSA 2021) (2021)

Graph-Theoretic Concepts in Computer Science : 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, revised selected papers

Veröffentlicht 2021

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)

List Covering of Regular Multigraphs

von Bok, Jan
Veröffentlicht in IWOCA (33. : 2022 : Trier) Combinatorial algorithms (2022)