On Adaptive Algorithms for Maximum Matching. - Falko Hegerfeld; Stefan Kratsch (ICALP, 2019)

Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. - Falko Hegerfeld; Stefan Kratsch (STACS, 2020)

PACE-Challenge-2020-HU-Berlin-Exact-Track. - Narek Bojikian; Alexander van der Grinten; Falko Hegerfeld; Laurence Alec Kluge; Stefan Kratsch (Zenodo, 2020)

Towards Exact Structural Thresholds for Parameterized Complexity. - Falko Hegerfeld; Stefan Kratsch (IPEC, 2022)

Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. - Falko Hegerfeld; Stefan Kratsch (ESA, 2023)

Tight Bounds for Connectivity Problems Parameterized by Cutwidth. - Narek Bojikian; Vera Chekan; Falko Hegerfeld; Stefan Kratsch (STACS, 2023)

Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. - Falko Hegerfeld; Stefan Kratsch (WG, 2023)

Fine-Grained Parameterized Algorithms on Width Parameters and Beyond - Falko Hegerfeld (2023)