Daniel Neuen

From MaRDI portal
Person:4606342


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Canonisation and definability for graphs of bounded rank width
 
2024-12-19Paper
Optimally repurposing existing algorithms to obtain exponential-time approximations
 
2024-11-28Paper
Isomorphism testing for graphs excluding small topological subgraphs
 
2024-07-19Paper
A framework for parameterized subexponential algorithms for generalized cycle hitting problems on planar graphs
 
2024-07-19Paper
A study of Weisfeiler-Leman colorings on planar graphs
 
2024-06-24Paper
Computing square colorings on bounded-treewidth and planar graphs
 
2024-05-14Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
 
2024-05-14Paper
Isomorphism Testing Parameterized by Genus and Beyond
SIAM Journal on Discrete Mathematics
2024-02-07Paper
A Faster Isomorphism Test for Graphs of Small Degree
SIAM Journal on Computing
2023-12-19Paper
Hypergraph Isomorphism for Groups with Restricted Composition Factors
ACM Transactions on Algorithms
2023-10-31Paper
scientific article; zbMATH DE number 7740927 (Why is no real title available?)
 
2023-09-20Paper
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width
 
2023-04-14Paper
Isomorphism Testing for Graphs Excluding Small Minors
SIAM Journal on Computing
2023-04-04Paper
Canonisation and Definability for Graphs of Bounded Rank Width
ACM Transactions on Computational Logic
2023-02-07Paper
Recent advances on the graph isomorphism problem
 
2022-11-18Paper
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
 
2022-07-21Paper
A Study of Weisfeiler-Leman Colorings on Planar Graphs
 
2022-06-21Paper
The power of the Weisfeiler-Leman algorithm to decompose graphs
SIAM Journal on Discrete Mathematics
2022-02-09Paper
An improved isomorphism test for bounded-tree-width graphs
 
2021-07-28Paper
An improved isomorphism test for bounded-tree-width graphs
ACM Transactions on Algorithms
2021-05-03Paper
Benchmark Graphs for Practical Graph Isomorphism
 
2020-05-27Paper
Subgroups of 3-factor direct products
Tatra Mountains Mathematical Publications
2019-09-30Paper
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
2019-08-22Paper
Graph isomorphism for unit square graphs
 
2018-03-02Paper
Subgroups of 3-factor direct products
 
2016-07-12Paper
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
 
N/APaper
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
 
N/APaper


Research outcomes over time


This page was built for person: Daniel Neuen