On the Role of 3’s for the 1-2-3 Conjecture

von Bensmail, Julien
Veröffentlicht in CIAC (12. : 2021 : Online) Algorithms and Complexity (2021)

The Largest Connected Subgraph Game

von Bensmail, Julien
Veröffentlicht in WG (47. : 2021 : Online) Graph-Theoretic Concepts in Computer Science (2021)

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)