Spöhel, Reto Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Gugelmann, L., & Spöhel, R. (2011). On Balanced Coloring Games in Random Graphs. In J. Nešetřil, E. Győri, & A. Sali (Eds.), The Sixth European Conference on Combinatorics, Graph Theory and Applications (pp. 425-430). Amsterdam: Elsevier. doi:10.1016/j.endm.2011.09.069.