Publications

1. Logical Labeling Schemes (Preprint)
   Discrete Mathematics, Volume 346, Issue 10, October 2023
2. Separating Algorithmic Thinking and Programming
   9. Fachtagung Hochschuldidaktik Informatik (HDI), 2021
3. A Systematic Approach to Programming (corrigendum)
   Arxiv, CoRR abs/1808.08989, 2019
4. Fundamentals of Parameterized Complexity Revisited
   Arxiv, CoRR abs/1804.11089, 2019
5. A Complexity Theory for Labeling Schemes
   Arxiv, CoRR abs/1802.02819, 2018
   superseded by [8]
6. Canonical Representations for Circular-Arc Graphs Using Flip Sets (Preprint)
   Algorithmica Volume 80, Issue 12, pp 3646-3672, 2018
   
7. On the Implicit Graph Conjecture
   41st Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
   superseded by [4,8]
8. Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
   33rd Symposium on Theoretical Aspects of Computer Science (STACS), 2016
   superseded by [3]

• Computational Complexity Aspects of Implicit Graph Representations
  PhD Thesis, Leibniz Universität Hannover, Germany, 2017
• Completeness Results for Graph Isomorphism on Restricted Graph Classes
  Master's Thesis, Leibniz Universität Hannover, Germany, 2014
• Hierarchies of Recursive Functions
  Bachelor's Thesis, Leibniz Universität Hannover, Germany, 2013

Talks

• Descriptive Complexity of Graph Classes via Labeling Schemes (slides)
  Algorithms, Complexity Theory and Optimisation Series, University of Liverpool, 2021
• Trace-Based Programming Method (slides)
  Approaches and Applications of Inductive Programming, Dagstuhl-Seminar 19202, 2019
• A Complexity Theory for Implicit Graph Representations
  18th International Workshop on Logic and Computational Complexity (LCC), Reykjavik, Iceland, 2017
• Finding Canonical Representations for Circular-Arc Graphs
  The Graph Isomorphism Problem, Dagstuhl-Seminar 15511, 2015