معرفی
Dr. Daniel Neuen is a researcher at the Max Planck Institute for Informatics, affiliated with the Algorithms and Complexity department. He holds a PhD from RWTH Aachen University (2020) and has held academic roles including Interim Professor at the University of Bremen (2023–2024) and Postdoc positions at Simon Fraser University (2022–2023) and the University of Regensburg (2024). His research focuses on parameterized complexity, graph isomorphism, symmetry detection, and computational group theory.
Education
- B.Sc. Computer Science, RWTH Aachen University (2010–2013)
- M.Sc. Computer Science, RWTH Aachen University (2013–2015)
- Ph.D. in Computer Science, RWTH Aachen University (2015–2020)
His work emphasizes graph theory and algorithm design, with contributions to isomorphism testing, computational complexity, and lower bounds analysis. Notable publications include advancements in Weisfeiler-Leman algorithms and graph canonisation techniques. He actively contributes to theoretical computer science without specific awards listed.
Current research involves collaboration with international institutions, focusing on structural graph theory and algorithmic efficiency.
