Up a level |
(2023) Computing Square Colorings on Bounded-Treewidth and Planar Graphs.
(2023) Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
(2022) Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
(2022) A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
(2022) Isomorphism Testing for Graphs Excluding Small Topological Subgraphs.
(2021) Isomorphism Testing Parameterized by Genus and Beyond.
(2020) Isomorphism Testing for Graphs Excluding Small Minors.