Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

von Golovach, Petr A.
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)

Block Elimination Distance

von Diner, Öznur Yasar
Veröffentlicht in WG (47. : 2021 : Online) Graph-Theoretic Concepts in Computer Science (2021)

Shortest Cycles with Monotone Submodular Costs

von Fomin, Fedor V.
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 3 of 7 (2023)

Fixed-Parameter Tractability of Maximum Colored Path and Beyond

von Fomin, Fedor V.
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)