| 2026 | LICS | Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs. | Daniel Neuen, Tim Seppelt |
| 2025 | ESA | Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. | Radu Curticapean, Simon Dring, Daniel Neuen |
| 2025 | ICALP | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | SODA | Counting Small Induced Subgraphs: Hardness via Fourier Analysis. | Radu Curticapean, Daniel Neuen |
| 2025 | STACS | Can You Link Up With Treewidth? | Radu Curticapean, Simon Dring, Daniel Neuen, Jiaheng Wang |
| 2024 | ICALP | Isomorphism for Tournaments of Small Twin Width. | Martin Grohe, Daniel Neuen |
| 2024 | LICS | Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. | Sandra Kiefer, Daniel Neuen |
| 2024 | SODA | Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2024 | STACS | Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. | Daniel Neuen |
| 2023 | FOCS | Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. | Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer |
| 2023 | LICS | The Iteration Number of the Weisfeiler-Leman Algorithm. | Martin Grohe, Moritz Lichter, Daniel Neuen |
| 2023 | SODA | Computing Square Colorings on Bounded-Treewidth and Planar Graphs. | Akanksha Agrawal, Dniel Marx, Daniel Neuen, Jasper Slusallek |
| 2023 | SODA | Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. | Jacob Focke, Dniel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz |
| 2022 | ESA | Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2022 | ICALP | A Study of Weisfeiler-Leman Colorings on Planar Graphs. | Sandra Kiefer, Daniel Neuen |
| 2022 | SODA | A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. | Dniel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale |
| 2022 | SODA | Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. | Daniel Neuen |
| 2021 | ESA | Isomorphism Testing Parameterized by Genus and Beyond. | Daniel Neuen |
| 2020 | FOCS | Isomorphism Testing for Graphs Excluding Small Minors. | Martin Grohe, Daniel Wiebking, Daniel Neuen |
| 2020 | ICALP | Hypergraph Isomorphism for Groups with Restricted Composition Factors. | Daniel Neuen |
| 2019 | LICS | Canonisation and Definability for Graphs of Bounded Rank Width. | Martin Grohe, Daniel Neuen |
| 2019 | MFCS | The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. | Sandra Kiefer, Daniel Neuen |
| 2018 | FOCS | A Faster Isomorphism Test for Graphs of Small Degree. | Martin Grohe, Daniel Neuen, Pascal Schweitzer |
| 2018 | ICALP | An Improved Isomorphism Test for Bounded-Tree-Width Graphs. | Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking |
| 2018 | STOC | An exponential lower bound for individualization-refinement algorithms for graph isomorphism. | Daniel Neuen, Pascal Schweitzer |
| 2017 | ESA | Benchmark Graphs for Practical Graph Isomorphism. | Daniel Neuen, Pascal Schweitzer |
| 2016 | ESA | Graph Isomorphism for Unit Square Graphs. | Daniel Neuen |