Daniel Wiebking

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!

Publication	Date of Publication	Type
Graph isomorphism in quasipolynomial time parameterized by treewidth	2026-03-18	Paper
Isomorphism testing for graphs excluding small minors	2025-08-12	Paper
scientific article; zbMATH DE number 7788492 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Isomorphism Testing for Graphs Excluding Small Minors SIAM Journal on Computing	2023-04-04	Paper
An improved isomorphism test for bounded-tree-width graphs (available as arXiv preprint)	2021-07-28	Paper
An improved isomorphism test for bounded-tree-width graphs ACM Transactions on Algorithms	2021-05-03	Paper
Normalizes and permutational isomorphisms in simply-exponential time Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms	2021-02-02	Paper
Automorphism groups of graphs of bounded Hadwiger number	2020-12-28	Paper
A unifying method for the design of algorithms canonizing combinatorial objects Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	2020-01-30	Paper
Graph isomorphism in quasipolynomial time parameterized by treewidth	2019-11-25	Paper
Normalizers and permutational isomorphisms in simply-exponential time (available as arXiv preprint)	2019-04-24	Paper

Research outcomes over time

This page was built for person: Daniel Wiebking