| Benchmark graphs for practical graph isomorphism D Neuen, P Schweitzer arXiv preprint arXiv:1705.03686, 2017 | 44 | 2017 |
| An exponential lower bound for individualization-refinement algorithms for graph isomorphism D Neuen, P Schweitzer Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 41 | 2018 |
| A faster isomorphism test for graphs of small degree M Grohe, D Neuen, P Schweitzer SIAM Journal on Computing 52 (6), FOCS18-1-FOCS18-36, 2020 | 39 | 2020 |
| Canonisation and definability for graphs of bounded rank width M Grohe, D Neuen ACM Transactions on Computational Logic 24 (1), 1-31, 2023 | 34 | 2023 |
| An improved isomorphism test for bounded-tree-width graphs M Grohe, D Neuen, P Schweitzer, D Wiebking ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020 | 31 | 2020 |
| Homomorphism-distinguishing closedness for graphs of bounded tree-width D Neuen arXiv preprint arXiv:2304.07011, 2023 | 28 | 2023 |
| The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs S Kiefer, D Neuen SIAM Journal on Discrete Mathematics 36 (1), 252-298, 2022 | 27 | 2022 |
| Recent advances on the graph isomorphism problem M Grohe, D Neuen arXiv preprint arXiv:2011.01366, 2020 | 26 | 2020 |
| Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results J Focke, D Marx, F Mc Inerney, D Neuen, GS Sankar, P Schepper, ... ACM Transactions on Computation Theory, 2024 | 18 | 2024 |
| Hypergraph isomorphism for groups with restricted composition factors D Neuen ACM Transactions on Algorithms (TALG) 18 (3), 1-50, 2022 | 14 | 2022 |
| The iteration number of the Weisfeiler-Leman algorithm M Grohe, M Lichter, D Neuen ACM Transactions on Computational Logic 26 (1), 1-31, 2025 | 12 | 2025 |
| Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements M Grohe, M Lichter, D Neuen, P Schweitzer 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 12 | 2023 |
| Isomorphism, canonization, and definability for graphs of bounded rank width M Grohe, D Neuen Communications of the ACM 64 (5), 98-105, 2021 | 12 | 2021 |
| Graph isomorphism for unit square graphs D Neuen arXiv preprint arXiv:1602.08371, 2016 | 12 | 2016 |
| Isomorphism testing for graphs excluding small minors M Grohe, D Neuen, D Wiebking SIAM Journal on Computing 52 (1), 238-272, 2023 | 11 | 2023 |
| Isomorphism testing parameterized by genus and beyond D Neuen SIAM Journal on Discrete Mathematics 38 (1), 453-484, 2024 | 9 | 2024 |
| Isomorphism testing for graphs excluding small topological subgraphs D Neuen ACM Transactions on Algorithms 20 (3), 1-43, 2024 | 8 | 2024 |
| Faster exponential-time approximation algorithms using approximate monotone local search BC Esmer, A Kulik, D Marx, D Neuen, R Sharma arXiv preprint arXiv:2206.13481, 2022 | 7 | 2022 |
| Subgroups of 3-factor direct products D Neuen, P Schweitzer arXiv preprint arXiv:1607.03444, 2016 | 7 | 2016 |
| The power of algorithmic approaches to the graph isomorphism problem D Neuen Dissertation, RWTH Aachen University, 2019, 2019 | 6 | 2019 |
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
