Exact and Parameterized Algorithms for Choosability

von Bliznets, Ivan
Veröffentlicht in SOFSEM (49. : 2024 : Cochem) SOFSEM 2024: theory and practice of computer science (2024)

Algorithms and Turing Kernels for Detecting and Counting Small Patterns inUnit Disk Graphs

von Nederlof, Jesper
Veröffentlicht in SOFSEM (49. : 2024 : Cochem) SOFSEM 2024: theory and practice of computer science (2024)

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

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

A Faster Exponential Time Algorithm for Bin Packing with a Constant Number of Bins via Additive Combinatories

von Nederlof, Jesper
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)

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

von Nederlof, Jesper
Veröffentlicht in WG (46. : 2020 : Online) Graph-theoretic concepts in computer science (2020)