Folgen
Daniel Neuen
Daniel Neuen
Bestätigte E-Mail-Adresse bei uni-bremen.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Benchmark graphs for practical graph isomorphism
D Neuen, P Schweitzer
arXiv preprint arXiv:1705.03686, 2017
392017
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
372020
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
362018
Canonisation and definability for graphs of bounded rank width
M Grohe, D Neuen
ACM Transactions on Computational Logic 24 (1), 1-31, 2023
342023
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
312020
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
S Kiefer, D Neuen
SIAM Journal on Discrete Mathematics 36 (1), 252-298, 2022
242022
Recent advances on the graph isomorphism problem
M Grohe, D Neuen
arXiv preprint arXiv:2011.01366, 2020
172020
Homomorphism-distinguishing closedness for graphs of bounded tree-width
D Neuen
arXiv preprint arXiv:2304.07011, 2023
122023
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
J Focke, D Marx, FM Inerney, D Neuen, GS Sankar, P Schepper, ...
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
122023
Isomorphism, canonization, and definability for graphs of bounded rank width
M Grohe, D Neuen
Communications of the ACM 64 (5), 98-105, 2021
122021
Isomorphism testing for graphs excluding small minors
M Grohe, D Neuen, D Wiebking
SIAM Journal on Computing 52 (1), 238-272, 2023
112023
Hypergraph isomorphism for groups with restricted composition factors
D Neuen
ACM Transactions on Algorithms (TALG) 18 (3), 1-50, 2022
112022
Graph isomorphism for unit square graphs
D Neuen
arXiv preprint arXiv:1602.08371, 2016
102016
Isomorphism testing parameterized by genus and beyond
D Neuen
SIAM Journal on Discrete Mathematics 38 (1), 453-484, 2024
82024
The iteration number of the Weisfeiler-Leman algorithm
M Grohe, M Lichter, D Neuen
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023
82023
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs∗
D Neuen
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
72022
Subgroups of 3-factor direct products
D Neuen, P Schweitzer
Tatra Mountains Mathematical Publications 73 (1), 19-38, 2019
72019
The power of algorithmic approaches to the graph isomorphism problem
D Neuen
Dissertation, RWTH Aachen University, 2019, 2019
52019
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
32023
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
32022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20