Daniel Neuen - RankMe

75 papers A* 18A 7B 3Journal 46Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs. CoRR Daniel Neuen, Tim Seppelt
2026	J	`jnl`	Isomorphism for Tournaments of Small Twin Width. TheoretiCS Martin Grohe, Daniel Neuen
2026	J	`jnl`	Parameterized complexity of graph isomorphism testing. Comput. Sci. Rev. Daniel Neuen
2025	A	`conf`	Can You Link Up With Treewidth? STACS Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
2025	J	`jnl`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. J. ACM Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2025	A*	`conf`	Counting Small Induced Subgraphs: Hardness via Fourier Analysis. SODA Radu Curticapean, Daniel Neuen
2025	A	`conf`	Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. ESA Radu Curticapean, Simon Döring, Daniel Neuen
2025	J	`jnl`	Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial. CoRR Radu Curticapean, Simon Döring, Daniel Neuen
2025	A*	`conf`	Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. ICALP Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025	J	`jnl`	The Iteration Number of the Weisfeiler-Leman Algorithm. ACM Trans. Comput. Log. Martin Grohe, Moritz Lichter, Daniel Neuen
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. ACM Trans. Algorithms Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2025	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. ACM Trans. Comput. Theory Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2025	B	`conf`	Treedepth Inapproximability and Exponential ETH Lower Bound. IPEC Édouard Bonnet, Daniel Neuen, Marek Sokolowski
2025	J	`jnl`	Treedepth Inapproximability and Exponential ETH Lower Bound. CoRR Édouard Bonnet, Daniel Neuen, Marek Sokolowski
2024	A*	`conf`	Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. LICS Sandra Kiefer, Daniel Neuen
2024	J	`jnl`	Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. CoRR Sandra Kiefer, Daniel Neuen
2024	J	`jnl`	Can You Link Up With Treewidth? CoRR Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
2024	J	`jnl`	Counting Small Induced Subgraphs: Hardness via Fourier Analysis. CoRR Radu Curticapean, Daniel Neuen
2024	A	`conf`	Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. STACS Daniel Neuen
2024	J	`jnl`	Isomorphism Testing Parameterized by Genus and Beyond. SIAM J. Discret. Math. Daniel Neuen
2024	J	`jnl`	Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. ACM Trans. Algorithms Daniel Neuen
2024	A*	`conf`	Isomorphism for Tournaments of Small Twin Width. ICALP Martin Grohe, Daniel Neuen
2024	A*	`conf`	Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2024	J	`jnl`	Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2023	J	`jnl`	A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. Martin Grohe, Daniel Neuen, Pascal Schweitzer
2023	B	`conf`	Approximate Monotone Local Search for Weighted Problems. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	J	`jnl`	Approximate Monotone Local Search for Weighted Problems. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	J	`jnl`	Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. Martin Grohe, Daniel Neuen
2023	A*	`conf`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2023	J	`jnl`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2023	A*	`conf`	Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
2023	J	`jnl`	Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. CoRR Daniel Neuen
2023	J	`jnl`	Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. Martin Grohe, Daniel Neuen, Daniel Wiebking
2023	J	`jnl`	Isomorphism for Tournaments of Small Twin Width. CoRR Martin Grohe, Daniel Neuen
2023	J	`jnl`	Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	A*	`conf`	The Iteration Number of the Weisfeiler-Leman Algorithm. LICS Martin Grohe, Moritz Lichter, Daniel Neuen
2023	J	`jnl`	The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR Martin Grohe, Moritz Lichter, Daniel Neuen
2023	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2023	A*	`conf`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2022	A*	`conf`	A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
2022	A*	`conf`	A Study of Weisfeiler-Leman Colorings on Planar Graphs. ICALP Sandra Kiefer, Daniel Neuen
2022	J	`jnl`	A Study of Weisfeiler-Leman Colorings on Planar Graphs. CoRR Sandra Kiefer, Daniel Neuen
2022	J	`jnl`	Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
2022	A	`conf`	Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022	J	`jnl`	Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022	J	`jnl`	Hypergraph Isomorphism for Groups with Restricted Composition Factors. ACM Trans. Algorithms Daniel Neuen
2022	A*	`conf`	Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. SODA Daniel Neuen
2022	J	`jnl`	The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. SIAM J. Discret. Math. Sandra Kiefer, Daniel Neuen
2022	J	`jnl`	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2021	J	`jnl`	A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
2021	A	`conf`	Isomorphism Testing Parameterized by Genus and Beyond. ESA Daniel Neuen
2021	J	`jnl`	Isomorphism Testing Parameterized by Genus and Beyond. CoRR Daniel Neuen
2021	J	`jnl`	Isomorphism, canonization, and definability for graphs of bounded rank width. Commun. ACM Martin Grohe, Daniel Neuen
2021	—	`conf`	Recent advances on the graph isomorphism problem. BCC Martin Grohe, Daniel Neuen
2020	J	`jnl`	An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
2020	A*	`conf`	Hypergraph Isomorphism for Groups with Restricted Composition Factors. ICALP Daniel Neuen
2020	J	`jnl`	Hypergraph Isomorphism for Groups with Restricted Composition Factors. CoRR Daniel Neuen
2020	A*	`conf`	Isomorphism Testing for Graphs Excluding Small Minors. FOCS Martin Grohe, Daniel Wiebking, Daniel Neuen
2020	J	`jnl`	Isomorphism Testing for Graphs Excluding Small Minors. CoRR Martin Grohe, Daniel Neuen, Daniel Wiebking
2020	J	`jnl`	Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. CoRR Daniel Neuen
2020	J	`jnl`	Recent Advances on the Graph Isomorphism Problem. CoRR Martin Grohe, Daniel Neuen
2019	A*	`conf`	Canonisation and Definability for Graphs of Bounded Rank Width. LICS Martin Grohe, Daniel Neuen
2019	J	`jnl`	Canonisation and Definability for Graphs of Bounded Rank Width. CoRR Martin Grohe, Daniel Neuen
2019	B	`conf`	The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. MFCS Sandra Kiefer, Daniel Neuen
2019	J	`jnl`	The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. CoRR Sandra Kiefer, Daniel Neuen
2018	A*	`conf`	A Faster Isomorphism Test for Graphs of Small Degree. FOCS Martin Grohe, Daniel Neuen, Pascal Schweitzer
2018	A*	`conf`	An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
2018	A*	`conf`	An exponential lower bound for individualization-refinement algorithms for graph isomorphism. STOC Daniel Neuen, Pascal Schweitzer
2018	J	`jnl`	An improved isomorphism test for bounded-tree-width graphs. CoRR Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
2018	J	`jnl`	Towards faster isomorphism tests for bounded-degree graphs. CoRR Martin Grohe, Daniel Neuen, Pascal Schweitzer
2017	J	`jnl`	An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism. CoRR Daniel Neuen, Pascal Schweitzer
2017	A	`conf`	Benchmark Graphs for Practical Graph Isomorphism. ESA Daniel Neuen, Pascal Schweitzer
2017	J	`jnl`	Benchmark Graphs for Practical Graph Isomorphism. CoRR Daniel Neuen, Pascal Schweitzer
2016	A	`conf`	Graph Isomorphism for Unit Square Graphs. ESA Daniel Neuen
2016	J	`jnl`	Graph Isomorphism for unit square graphs. CoRR Daniel Neuen