A list of publications can be found at DBLP. A full version of all papers is available on arXiv.

Selected Papers

• Martin Grohe, Moritz Lichter, Daniel Neuen, and Pascal Schweitzer. Compressing CFI graphs and lower bounds for the Weisfeiler‑Leman refinements. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6‑9, 2023, pages 798–809. IEEE, 2023. DOI.
• Daniel Neuen. Isomorphism testing for graphs excluding small topological subgraphs. ACM Trans. Algorithms, 20(3):25, 2024. DOI.
• Martin Grohe, Daniel Neuen, and Pascal Schweitzer. A faster isomorphism test for graphs of small degree. SIAM J. Comput., 52(6):FOCS18‑1–FOCS18‑36, 2023. DOI.
• Martin Grohe and Daniel Neuen. Canonisation and definability for graphs of bounded rank width. ACM Trans. Comput. Log., 24(1):6:1–6:31, 2023. DOI.
• Daniel Neuen and Pascal Schweitzer. An exponential lower bound for individualization-refinement algorithms for graph isomorphism. In 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 138–150. ACM, 2018. DOI.

April 2024 - September 2024:
Postdoc at University of Regensburg (Regensburg, Germany)

April 2023 - March 2024:
Interim Professor at University of Bremen (Bremen, Germany)

April 2022 - March 2023:
Postdoc at Simon Fraser University (Vancouver, Canada)

November 2015 - March 2020:
Ph. D. student at Computer Science 7 (Logic and Theory of Discrete Systems) at RWTH Aachen University, Germany

October 2013 - September 2015:
M.Sc. in Computer Science at RWTH Aachen University, Germany

October 2010 - September 2013:
B.Sc. in Computer Science at RWTH Aachen University, Germany