Advanced algorithmics

I am a Software Engineer and Applied Scientist at TomTom. Before that, I did my PhD on parameterized algorithmics with Rolf Niedermeier at TU Berlin, mostly on temporal graphs and multistage problems.

dblp Google Scholar CV & contact

Publications

2025

The complexity of transitively orienting temporal graphs

with George B. Mertzios, Hendrik Molter, Malte Renken, and Paul G. Spirakis

J. Comput. Syst. Sci. (2025) MFCS 2021 arXiv (2021) BibTeX

2024

Disentangling the Computational Complexity of Network Untangling

with Vincent Froese and Pascal Kunz

Theory Comput. Syst. (2024) IJCAI 2022 arXiv (2022) BibTeX

Temporal reachability minimization: Delaying vs. deleting

with Hendrik Molter and Malte Renken

J. Comput. Syst. Sci. (2024) MFCS 2021 arXiv (2021) BibTeX

2023

Restless Temporal Path Parameterized Above Lower Bounds

STACS 2023 arXiv (2022) BibTeX

Interference-free walks in time: temporally disjoint paths

with Nina Klobas, George B. Mertzios, Hendrik Molter, and Rolf Niedermeier

Auton. Agents Multi Agent Syst. (2023) IJCAI 2021 arXiv (2021) BibTeX

Multistage s-t Path: Confronting Similarity with Dissimilarity

with Till Fluschnik, Rolf Niedermeier, and Carsten Schubert

Algorithmica (2023) ISAAC 2020 arXiv (2020) BibTeX

Using a Geometric Lens to Find k-Disjoint Shortest Paths

with Matthias Bentert, André Nichterlein, and Malte Renken

SIAM J. Discret. Math. (2023) ICALP 2021 arXiv (2020) BibTeX

Computing maximum matchings in temporal graphs

with George B. Mertzios, Hendrik Molter, Rolf Niedermeier, and Viktor Zamaraev

J. Comput. Syst. Sci. (2023) STACS 2020 arXiv (2019) BibTeX

2022

Parameterized algorithmics for time-evolving structures: temporalizing and multistaging (Parametrisierte Algorithmik für zeitabhängige Strukturen: Temporalisierung and Mehrstufigkeit)

TU Berlin, Germany (2022) BibTeX

A faster parameterized algorithm for temporal matching

Inf. Process. Lett. (2022) arXiv (2020) BibTeX

Multistage Vertex Cover

with Till Fluschnik, Rolf Niedermeier, and Valentin Rohm

Theory Comput. Syst. (2022) IPEC 2019 arXiv (2019) BibTeX

2021

Parameterized Algorithms for Diverse Multistage Problems

with Leon Kellerhals and Malte Renken

ESA 2021 arXiv (2021) BibTeX

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing

with Leon Kellerhals, Tomohiro Koana, and André Nichterlein

IPEC 2021 BibTeX

Optimal Virtual Network Embeddings for Tree Topologies

with Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, and Stefan Schmid

SPAA 2021 arXiv (2021) BibTeX

Finding Temporal Paths Under Waiting Time Constraints

with Arnaud Casteigts, Anne-Sophie Himmel, and Hendrik Molter

Algorithmica (2021) ISAAC 2020 arXiv (2019) BibTeX

Representative families for matroid intersections, with applications to location, packing, and covering problems

with René van Bevern and Oxana Yu. Tsidulko

Discret. Appl. Math. (2021) CIAC 2019 arXiv (2018) BibTeX

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments

with Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, and Rolf Niedermeier

ACM J. Exp. Algorithmics (2021) ESA 2018 arXiv (2018) BibTeX

2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs

with Till Fluschnik, Hendrik Molter, Rolf Niedermeier, and Malte Renken

Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday arXiv (2020) BibTeX

Temporal graph classes: A view through temporal separators

with Till Fluschnik, Hendrik Molter, Rolf Niedermeier, and Malte Renken

Theor. Comput. Sci. (2020) WG 2018 arXiv (2018) BibTeX

The complexity of finding small separators in temporal graphs

with Till Fluschnik, Hendrik Molter, and Rolf Niedermeier

J. Comput. Syst. Sci. (2020) MFCS 2018 arXiv (2017) BibTeX

2017

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections

with Leon Kellerhals, Viatcheslav Korenwein, Robert Bredereck, and Jiehua Chen

TAMC 2017 arXiv (2017) BibTeX