Daniel Neuen
Scholar

Daniel Neuen

Google Scholar ID: -AKuF3gAAAAJ
Max-Planck-Institute for Informatics
Theoretical Computer ScienceAlgorithms and Complexity
Citations & Impact
All-time
Citations
435
 
H-index
12
 
i10-index
15
 
Publications
20
 
Co-authors
10
list available
Resume (English only)
Academic Achievements
  • Published paper 'Compressing CFI graphs and lower bounds for the Weisfeiler‑Leman refinements' at FOCS 2023
  • Published 'Isomorphism testing for graphs excluding small topological subgraphs' in ACM Trans. Algorithms, 2024
  • Published 'A faster isomorphism test for graphs of small degree' in SIAM J. Comput., 2023
  • Published 'Canonisation and definability for graphs of bounded rank width' in ACM Trans. Comput. Log., 2023
  • Published 'An exponential lower bound for individualization-refinement algorithms for graph isomorphism' at STOC 2018
  • Full versions of all papers available on arXiv; publication list accessible via DBLP