Daniel Neuen

According to our database, Daniel Neuen authored at least 30 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs.

Daniel Neuen

ACM Trans. Algorithms, July, 2024

Isomorphism Testing Parameterized by Genus and Beyond.

Daniel Neuen

SIAM J. Discret. Math., March, 2024

Can You Link Up With Treewidth?

Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang

CoRR, 2024

Counting Small Induced Subgraphs: Hardness via Fourier Analysis.

Radu Curticapean, Daniel Neuen

CoRR, 2024

Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width.

Daniel Neuen

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees.

Sandra Kiefer, Daniel Neuen

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Isomorphism for Tournaments of Small Twin Width.

Martin Grohe, Daniel Neuen

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

A Faster Isomorphism Test for Graphs of Small Degree.

Martin Grohe, Daniel Neuen, Pascal Schweitzer

SIAM J. Comput., December, 2023

Isomorphism Testing for Graphs Excluding Small Minors.

Martin Grohe, Daniel Neuen, Daniel Wiebking

SIAM J. Comput., February, 2023

Canonisation and Definability for Graphs of Bounded Rank Width.

Martin Grohe, Daniel Neuen

ACM Trans. Comput. Log., January, 2023

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

CoRR, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Computing Square Colorings on Bounded-Treewidth and Planar Graphs.

Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

The Iteration Number of the Weisfeiler-Leman Algorithm.

Martin Grohe, Moritz Lichter, Daniel Neuen

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Approximate Monotone Local Search for Weighted Problems.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Hypergraph Isomorphism for Groups with Restricted Composition Factors.

Daniel Neuen

ACM Trans. Algorithms, 2022

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs.

Sandra Kiefer, Daniel Neuen

SIAM J. Discret. Math., 2022

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

CoRR, 2022

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.

Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Study of Weisfeiler-Leman Colorings on Planar Graphs.

Sandra Kiefer, Daniel Neuen

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Isomorphism, canonization, and definability for graphs of bounded rank width.

Martin Grohe, Daniel Neuen

Commun. ACM, 2021

Recent advances on the graph isomorphism problem.

Martin Grohe, Daniel Neuen

Proceedings of the Surveys in Combinatorics, 2021

2020

An Improved Isomorphism Test for Bounded-tree-width Graphs.

Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking

ACM Trans. Algorithms, 2020

2018

Towards faster isomorphism tests for bounded-degree graphs.

Martin Grohe, Daniel Neuen, Pascal Schweitzer

CoRR, 2018

An exponential lower bound for individualization-refinement algorithms for graph isomorphism.

Daniel Neuen, Pascal Schweitzer

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Benchmark Graphs for Practical Graph Isomorphism.

Daniel Neuen, Pascal Schweitzer

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Graph Isomorphism for Unit Square Graphs.

Daniel Neuen

Proceedings of the 24th Annual European Symposium on Algorithms, 2016