• Counting Problems
• Parameterized Algorithms
• Complexity Theory
• Graph Theory
• Combinatorics

• Counting Small Induced Subgraphs with Edge-monotone Properties (arXiv)
  Simon Döring, Dániel Marx, Philip Wellnitz
  ACM Symposium on Theory of Computing (STOC 2024)

• December 2023 - present:
  Ph. D. student in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany and the Max-Planck-Institut für Informatik
  
  
• October 2018 - December 2023:
  Studies in Computer Science at the Universität des Saarlandes
  
• April 2020 - October 2021:
  Studies in Mathematics at the Universität des Saarlandes
  Bachelor Thesis: Bestimmung des minimalen Kongruenzlevels für
  arithmetische Untergruppen der SL(n, Z) und Sp(n, Z) (PDF)
  Supervisor: Prof. Weitze-Schmithüsen

Hobbies

• Reading
• Math
• Playing the piano (not good at this)