Neuen, Daniel

1. An exponential lower bound for Individualization-Refinement algorithms\n for Graph Isomorphism
   2017/05/09 by Daniel Neuen, Neuen, Daniel, Pascal Schweitzer +1 · 2 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph Theory and Algorithms #Machine Learning and Algorithms
2. Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width
   2023/04/14 by Neuen, Daniel · 3 citations
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
3. Recent Advances on the Graph Isomorphism Problem
   2020/11/02 by Martin Grohe, Grohe, Martin, Daniel Neuen +1 · 2 citations
   Computer Science · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Optimization and Search Problems
4. Graph Isomorphism for unit square graphs
   2016/02/26 by Daniel Neuen, Neuen, Daniel · 1 citation
   Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
5. Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
   2023/08/23 by Grohe, Martin, Lichter, Moritz, Neuen, Daniel +1 · 2 citations
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
6. An improved isomorphism test for bounded-tree-width graphs
   2018/03/19 by Grohe, Martin, Neuen, Daniel, Schweitzer, Pascal +1 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
7. Counting Small Induced Subgraphs: Hardness via Fourier Analysis
   2024/07/09 by Radu Curticapean, Curticapean, Radu, Daniel Neuen +1 · 2 citations
   Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Machine Learning and Data Classification
8. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
   2022/11/08 by Focke, Jacob, Marx, Dániel, Inerney, Fionn Mc +4 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
9. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
   2023/05/26 by Focke, Jacob, Marx, Dániel, Inerney, Fionn Mc +4 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.1