Heydrich, Sandy Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Heydrich, S. (2012). Dividing Connected Chores Fairly. Bachelor Thesis, Universität des Saarlandes, Saarbrücken.