Daniel Wiebking

M. Sc.
Daniel Wiebking
Lehrstuhl für Informatik 7 (Logik und Theorie diskreter Systeme)


Building: Erweiterungsbau 1

Room: 4118

Ahornstr. 55

52074 Aachen


Phone: +49 241 80 21714
Fax Fax: +49 241 80 22215

Office Hours

by appointment

Research Interests

Graph Isomorphism, Combinatorics and Group Theory



Title Author(s) Published in
Deep Weisfeiler Leman Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Graph isomorphism in quasipolynomial time parameterized by
Daniel Wiebking
Normalizers and permutational isomorphisms in simply-exponential time Daniel Wiebking Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA
2020, Salt Lake City, UT, USA, January 5-8, 2020
A unifying method for the design of algorithms canonizing combinatorial objects Pascal Schweitzer, Daniel Wiebking Proceedings of the 51st Annual ACM
SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA,
June 23-26, 2019
An improved isomorphism test for bounded-tree-width graphs Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic