Graph Isomorphism for Unit Square Graphs. - Daniel Neuen (ESA, 2016)

Benchmark Graphs for Practical Graph Isomorphism. - Daniel Neuen; Pascal Schweitzer (ESA, 2017)

An exponential lower bound for individualization-refinement algorithms for graph isomorphism. - Daniel Neuen; Pascal Schweitzer (STOC, 2018)

Towards faster isomorphism tests for bounded-degree graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer (CoRR, 2018)

An Improved Isomorphism Test for Bounded-tree-width Graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer; Daniel Wiebking (ACM Trans. Algorithms, 2020)

Recent advances on the graph isomorphism problem. - Martin Grohe; Daniel Neuen (BCC, 2021)

Isomorphism, canonization, and definability for graphs of bounded rank width. - Martin Grohe; Daniel Neuen (Commun. ACM, 2021)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (ESA, 2022)

A Study of Weisfeiler-Leman Colorings on Planar Graphs. - Sandra Kiefer; Daniel Neuen (ICALP, 2022)

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. - Dániel Marx; Pranabendu Misra; Daniel Neuen; Prafullkumar Tale (SODA, 2022)

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. - Sandra Kiefer; Daniel Neuen (SIAM J. Discret. Math., 2022)

Hypergraph Isomorphism for Groups with Restricted Composition Factors. - Daniel Neuen (ACM Trans. Algorithms, 2022)

Approximate Monotone Local Search for Weighted Problems. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (IPEC, 2023)

Computing Square Colorings on Bounded-Treewidth and Planar Graphs. - Akanksha Agrawal 001; Dániel Marx; Daniel Neuen; Jasper Slusallek (SODA, 2023)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (SODA, 2023)

Canonisation and Definability for Graphs of Bounded Rank Width. - Martin Grohe; Daniel Neuen (ACM Trans. Comput. Log., 2023)

Isomorphism Testing for Graphs Excluding Small Minors. - Martin Grohe; Daniel Neuen; Daniel Wiebking (SIAM J. Comput., 2023)

A Faster Isomorphism Test for Graphs of Small Degree. - Martin Grohe; Daniel Neuen; Pascal Schweitzer (SIAM J. Comput., 2023)

Isomorphism for Tournaments of Small Twin Width. - Martin Grohe; Daniel Neuen (ICALP, 2024)

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. - Sandra Kiefer; Daniel Neuen (LICS, 2024)

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (SODA, 2024)

Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. - Daniel Neuen (STACS, 2024)

Isomorphism Testing Parameterized by Genus and Beyond. - Daniel Neuen (SIAM J. Discret. Math., 2024)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. - Daniel Neuen (ACM Trans. Algorithms, 2024)

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Dániel Marx; Pranabendu Misra; Daniel Neuen; Saket Saurabh 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis. - Radu Curticapean; Daniel Neuen (SODA, 2025)

Can You Link Up With Treewidth? - Radu Curticapean; Simon Döring; Daniel Neuen; Jiaheng Wang 002 (STACS, 2025)

The Iteration Number of the Weisfeiler-Leman Algorithm. - Martin Grohe; Moritz Lichter; Daniel Neuen (ACM Trans. Comput. Log., 2025)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. - Radu Curticapean; Simon Döring; Daniel Neuen (CoRR, 2025)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. - Martin Grohe; Moritz Lichter; Daniel Neuen; Pascal Schweitzer (J. ACM, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Comput. Theory, 2025)

Treedepth Inapproximability and Exponential ETH Lower Bound. - Édouard Bonnet; Daniel Neuen; Marek Sokolowski 001 (CoRR, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Algorithms, 2025)