Biography
Dr. Daniel Neuen started his employment at the Algorithms and Complexity Theory group at University of Regensburg in April 2024.
He obtained his Phd in 2019 from RWTH Aachen University for his work on "The Power of Algorithmic Approaches to the Graph Isomorphism Problem". After that, he was a postdoc at MPI Informatics, CISPA Helmholtz Center for Information Security and Simon Fraser University. From April 2023 to March 2024 Daniel Neuen was an Interim Professor at University of Bremen.
His research focuses on the complexity of isomorphism testing and symmetry detection, as well as connections to graph theory, logics and group theory.
Publications
A list of my publications can be found at DBLP.
ORCID: 0000-0002-4940-0318
Selected publications:
- Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer: Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS 2023: 798-809. DOI: 10.1109/FOCS57990.2023.00052
- Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma: Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA 2022: 50:1-50:19. DOI: 10.4230/LIPICS.ESA.2022.50
- Daniel Neuen: Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. SODA 2022: 1411-1434. DOI: 10.1137/1.9781611977073.59
- Martin Grohe, Daniel Neuen: Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. 24(1): 6:1-6:31 (2023). DOI: 10.1145/3568025
- Martin Grohe, Daniel Neuen, Pascal Schweitzer: A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52(6): FOCS18-1-FOCS18-36 (2023). DOI: 10.1137/19M1245293
- Daniel Neuen, Pascal Schweitzer: An exponential lower bound for individualization-refinement algorithms for graph isomorphism. STOC 2018: 138-150. DOI: 10.1145/3188745.3188900
