Simon Döring

Simon Döring is a Ph.D. student in Computer Science at Universität des Saarlandes and Max-Planck-Institut für Informatik, specializing in Counting Problems, Parameterized Algorithms, and Complexity Theory. His research focuses on graph theory and combinatorial algorithms, particularly in subgraph enumeration and treewidth applications.

Research Interests:

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

Publications (2024–2025) span international symposia like STOC, SODA, ESA, and STACS, addressing subgraph counting, treewidth, and complexity bounds. His work bridges algorithm design and theoretical mathematics, including collaborations with researchers such as Radu Curticapean and Dániel Marx.