More often than not, life teems with difficult problems. This is not less true if you happen to be
a researcher in computational social choice; however, in this case you can spend …

Land banking practices have received little attention on how such practices shape informal
land markets in developing countries. Drawing on a relational complexity framework, this …

We present a list of parameterized problems together with a complexity classification of
whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are …

By Menger's theorem, the maximum number of arc-disjoint paths from a vertex s to a vertex t
in a directed graph equals the minimum number of arcs needed to disconnect s and t, ie, the …

The concept of a synchronizing word is a very important notion in the theory of finite
automata. We consider the associated decision problem to decide if a given DFA possesses …

Computer programs, so-called solvers, for solving the well-known Boolean satisfiability
problem (Sat) have been improving for decades. Among the reasons, why these solvers are …

We consider the complexity of deciding the winner of an election under the Slater rule. In this
setting we are given a tournament $ T=(V, A) $, where the vertices of V represent candidates …

Many open problems in graph theory aim to verify that a specific class of graphs has a
certain property. One example, which we study extensively in this thesis, is the 3 …

We study a social choice setting of manipulation in elections and extend the usual model in
two major ways: first, instead of considering a single manipulating agent, in our setting there …

This thesis is primarily motivated by a project with Deutsche Bahn about offer preparation in
rail freight transport. At its core, a customer should be offered three train paths to choose …