Daniel Wiebking

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 15

Top Topics

Synthetic And Real Data Sets

Bounded Tree Width

Graph Isomorphism

High Computational Complexity

Top Venues

Publications

Martin Grohe, Daniel Neuen, Daniel Wiebking
Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. 52 (1) (2023)
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Deep Weisfeiler Leman. SODA (2021)
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Deep Weisfeiler Leman. CoRR (2020)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16 (3) (2020)
Daniel Wiebking
Normalizers and permutational isomorphisms in simply-exponential time. SODA (2020)
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Automorphism groups of graphs of bounded Hadwiger number. CoRR (2020)
Martin Grohe, Daniel Wiebking, Daniel Neuen
Isomorphism Testing for Graphs Excluding Small Minors. FOCS (2020)
Daniel Wiebking
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth. ICALP (2020)
Martin Grohe, Daniel Neuen, Daniel Wiebking
Isomorphism Testing for Graphs Excluding Small Minors. CoRR (2020)
Pascal Schweitzer, Daniel Wiebking
A unifying method for the design of algorithms canonizing combinatorial objects. STOC (2019)
Daniel Wiebking
Normalizers and permutational isomorphisms in simply-exponential time. CoRR (2019)
Daniel Wiebking
Graph isomorphism in quasipolynomial time parameterized by treewidth. CoRR (2019)
Pascal Schweitzer, Daniel Wiebking
A unifying method for the design of algorithms canonizing combinatorial objects. CoRR (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An improved isomorphism test for bounded-tree-width graphs. CoRR (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP (2018)