Parameterized Complexity of Weighted Multicut in Trees

von Galby, Esther
Veröffentlicht in WG (48. : 2022 : Tübingen) Graph-theoretic concepts in computer science (2022)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

von Focke, Jacob
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7 (2023)