Publications

Logical Labeling Schemes
(Preprint)
Discrete Mathematics, Volume 346, Issue 10, October 2023

Separating Algorithmic Thinking and Programming
9. Fachtagung Hochschuldidaktik Informatik (HDI), 2021

A Systematic Approach to Programming (corrigendum)
Arxiv, CoRR abs/1808.08989, 2019

Fundamentals of Parameterized Complexity Revisited
Arxiv, CoRR abs/1804.11089, 2019

A Complexity Theory for Labeling Schemes
Arxiv, CoRR abs/1802.02819, 2018
superseded by [8]

Canonical Representations for CircularArc Graphs Using Flip Sets (Preprint)
Algorithmica Volume 80, Issue 12, pp 36463672, 2018

On the Implicit Graph Conjecture
41st Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
superseded by [4,8]

Deciding CircularArc 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.
Talks

Descriptive Complexity of Graph Classes via Labeling Schemes (slides)
Algorithms, Complexity Theory and Optimisation Series, University of Liverpool, 2021

TraceBased Programming Method (slides)
Approaches and Applications of Inductive Programming, DagstuhlSeminar 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 CircularArc Graphs
The Graph Isomorphism Problem, DagstuhlSeminar 15511, 2015