Daniel Neuen

Daniel Neuen

Max-Planck-Institut für Informatik
Department 1: Algorithms & Complexity
Parameterized Algorithms and Complexity
 office: Campus E1 4, Room 318
Saarland Informatics Campus
66123 Saarbrücken
 email: Get my email address via email
 phone: +49 681 9325 1018

Research Interests

  • 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.