Welcome Prof. Daniel Neuen

Prof. Daniel Neuen has held the Chair of Algorithmic and Structural Graph Theory since January 1, 2026. He completed his master's degree in computer science in 2015 at RWTH Aachen University, where he received his doctorate in 2019 on the topic of "The Power of Algorithmic Approaches to the Graph Isomorphism Problem". In 2020, he began working as a postdoc at the Max Planck Institute for Informatics in Saarbrücken and moved to the CISPA - Helmholtz Center for Information Security in the same year. In April 2022, he moved to Burnaby, Canada for one year, where he continued his research work at the School of Computing Science at Simon Fraser University. From 2023-2024, he was a Interim Professor at the University of Bremen.

His research interests lie in parameterized complexity, the graph isomorphism problem and symmetry detection as well as in computational group theory. Already during his studies Daniel Neuen won three prizes for his outstanding work, his research paper "Canonization and Definability for Graphs of Bounded Rank Width" (LICS 2019, together with Martin Grohe) was selected as a research highlight by the Communications of the ACM.

We are delighted to welcome Prof. Daniel Neuen to our faculty and wish him every success with his projects.