Daniel Neuen

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 59

Top Topics

Bounded Treewidth

Graph Isomorphism

Monadic Datalog

Top Venues

Publications

Martin Grohe, Daniel Neuen
Isomorphism for Tournaments of Small Twin Width. ICALP (2024)
Daniel Neuen
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. STACS (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA (2024)
Sandra Kiefer, Daniel Neuen
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. CoRR (2024)
Daniel Neuen
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. ACM Trans. Algorithms 20 (3) (2024)
Sandra Kiefer, Daniel Neuen
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. LICS (2024)
Daniel Neuen
Isomorphism Testing Parameterized by Genus and Beyond. SIAM J. Discret. Math. 38 (1) (2024)
Radu Curticapean, Daniel Neuen
Counting Small Induced Subgraphs: Hardness via Fourier Analysis. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR (2023)
Daniel Neuen
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. CoRR (2023)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen
The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR (2023)
Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. IPEC (2023)
Martin Grohe, Daniel Neuen
Isomorphism for Tournaments of Small Twin Width. CoRR (2023)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR (2023)
Martin Grohe, Daniel Neuen, Daniel Wiebking
Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. 52 (1) (2023)
Martin Grohe, Daniel Neuen
Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. 24 (1) (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen
The Iteration Number of the Weisfeiler-Leman Algorithm. LICS (2023)
Martin Grohe, Daniel Neuen, Pascal Schweitzer
A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52 (6) (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. CoRR (2023)
Sandra Kiefer, Daniel Neuen
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. SIAM J. Discret. Math. 36 (1) (2022)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. CoRR (2022)
Daniel Neuen
Hypergraph Isomorphism for Groups with Restricted Composition Factors. ACM Trans. Algorithms 18 (3) (2022)
Sandra Kiefer, Daniel Neuen
A Study of Weisfeiler-Leman Colorings on Planar Graphs. ICALP (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR (2022)
Sandra Kiefer, Daniel Neuen
A Study of Weisfeiler-Leman Colorings on Planar Graphs. CoRR (2022)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA (2022)
Daniel Neuen
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. SODA (2022)
Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA (2022)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR (2021)
Martin Grohe, Daniel Neuen
Recent advances on the graph isomorphism problem. BCC (2021)
Martin Grohe, Daniel Neuen
Isomorphism, canonization, and definability for graphs of bounded rank width. Commun. ACM 64 (5) (2021)
Daniel Neuen
Isomorphism Testing Parameterized by Genus and Beyond. ESA (2021)
Daniel Neuen
Isomorphism Testing Parameterized by Genus and Beyond. CoRR (2021)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16 (3) (2020)
Daniel Neuen
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. CoRR (2020)
Martin Grohe, Daniel Wiebking, Daniel Neuen
Isomorphism Testing for Graphs Excluding Small Minors. FOCS (2020)
Daniel Neuen
Hypergraph Isomorphism for Groups with Restricted Composition Factors. ICALP (2020)
Martin Grohe, Daniel Neuen
Recent Advances on the Graph Isomorphism Problem. CoRR (2020)
Martin Grohe, Daniel Neuen, Daniel Wiebking
Isomorphism Testing for Graphs Excluding Small Minors. CoRR (2020)
Daniel Neuen
Hypergraph Isomorphism for Groups with Restricted Composition Factors. CoRR (2020)
Martin Grohe, Daniel Neuen
Canonisation and Definability for Graphs of Bounded Rank Width. CoRR (2019)
Martin Grohe, Daniel Neuen
Canonisation and Definability for Graphs of Bounded Rank Width. LICS (2019)
Sandra Kiefer, Daniel Neuen
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. CoRR (2019)
Sandra Kiefer, Daniel Neuen
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. MFCS (2019)
Martin Grohe, Daniel Neuen, Pascal Schweitzer
A Faster Isomorphism Test for Graphs of Small Degree. FOCS (2018)
Daniel Neuen, Pascal Schweitzer
An exponential lower bound for individualization-refinement algorithms for graph isomorphism. STOC (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer
Towards faster isomorphism tests for bounded-degree graphs. CoRR (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An improved isomorphism test for bounded-tree-width graphs. CoRR (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP (2018)
Daniel Neuen, Pascal Schweitzer
Benchmark Graphs for Practical Graph Isomorphism. ESA (2017)
Daniel Neuen, Pascal Schweitzer
Benchmark Graphs for Practical Graph Isomorphism. CoRR (2017)
Daniel Neuen, Pascal Schweitzer
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism. CoRR (2017)
Daniel Neuen
Graph Isomorphism for Unit Square Graphs. ESA (2016)
Daniel Neuen
Graph Isomorphism for unit square graphs. CoRR (2016)