Jan Niclas Dreier

Jan Niclas Dreier is a PostDoc Researcher at TU Wien's Department of Algorithms and Complexity. His research focuses on theoretical computer science, particularly algorithmic meta-theorems, structural graph theory, and computational complexity. He is affiliated with projects such as REVEAL-AI and SLIM. His work addresses topics like monadic stability, SAT solving, and model checking on sparse graph classes.

Research Interests: Dreier's primary areas include algorithm design, parameterized complexity, and logic in computer science. His contributions span model checking for graph classes, backdoor analysis in SAT solving, and combinatorial properties of monadic dependence. Recent work explores the interplay between structural graph theory and algorithmic efficiency, with applications to finite model theory and pseudorandom models.

Teaching: He teaches courses such as Algorithmic Meta-Theorems, Algorithmics, and Bachelor Thesis in Computer Science. His courses emphasize theoretical foundations and practical algorithmic techniques.

Projects: Active involvement in the REVEAL-AI project (2020–2024) and SLIM (2019–2024), focusing on algorithmic advancements in AI and structural graph analysis.