In traditional service architectures that follow the service statelessness principle, the state is primarily held in the data tier. Here, service operators util

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 this thesis we describe dualities in directed as well as undirected graphs based on tools such as width-parameters, obstructions and substructures. We mainly

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