This thesis is concerned with analyzing the computational complexity of NP-hard problems related to data science. For most of the problems considered in this th

This thesis investigates the parameterized computational complexity of six classic graph problems lifted to a temporal setting. More specifically, we consider p

This thesis is concerned with investigating elements of computational social choice in the light of real-world applications. We contribute to a better understan

In dieser Arbeit entwickeln wir schnellere exakte Algorithmen (schneller bezüglich der Worst-Case-Laufzeit) für Spezialfälle von Graphproblemen. Diese Algori

In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for the study of matching minors and investigate a connection to t