• parameterized complexity
• graph isomorphism problem and symmetry detection
• computational group theory

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

Selected Papers

• Martin Grohe and Daniel Neuen. Canonisation and definability for graphs of bounded rank width. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pages 1–13. IEEE Computer Society, 2019. DOI.
• Martin Grohe, Daniel Neuen, and Pascal Schweitzer. A faster isomorphism test for graphs of small degree. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pages 89–100. IEEE Computer Society, 2018. 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.
• Daniel Neuen and Pascal Schweitzer. Benchmark graphs for practical graph isomorphism. In 25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, September 4-6, 2017, pages 60:1–60:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. DOI.

Bechmark graphs are available for download here.

• Nov 2015 - Mar 2020:
  Ph. D. student at Computer Science 7 (Logic and Theory of Discrete Systems) at RWTH Aachen University, Germany
  
• Oct 2013 - Sep 2015:
  M.Sc. in Computer Science at RWTH Aachen University, Germany
  
• Oct 2010 - Sep 2013:
  B.Sc. in Computer Science at RWTH Aachen University, Germany