1. Separating Algorithmic Thinking and Programming
    Repositorium der Leibniz Universität Hannover, DOI 10.15488/9177, 2020
  2. A Systematic Approach to Programming (corrigendum)
    Arxiv, CoRR abs/1808.08989, 2019
  3. Fundamentals of Parameterized Complexity Revisited
    Arxiv, CoRR abs/1804.11089, 2019
  4. A Complexity Theory for Labeling Schemes
    Arxiv, CoRR abs/1802.02819, 2018
  5. Canonical Representations for Circular-Arc Graphs Using Flip Sets
    Algorithmica Volume 80, Issue 12, pp 3646-3672, 2018
  6. On the Implicit Graph Conjecture
    41st Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
    superseded by [4]
  7. Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
    33rd Symposium on Theoretical Aspects of Computer Science (STACS), 2016
    superseded by [3]
The bachelor's and master's theses are direct links to the pdf files.