Daniel Wiebking

According to our database, Daniel Wiebking authored at least 7 papers between 2018 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Deep Weisfeiler Leman.

Martin Grohe, Pascal Schweitzer, Daniel Wiebking

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Automorphism groups of graphs of bounded Hadwiger number.

Martin Grohe, Pascal Schweitzer, Daniel Wiebking

CoRR, 2020

Normalizers and permutational isomorphisms in simply-exponential time.

Daniel Wiebking

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth.

Daniel Wiebking

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Isomorphism Testing for Graphs Excluding Small Minors.

Martin Grohe, Daniel Wiebking, Daniel Neuen

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

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, 2019

2018

An Improved Isomorphism Test for Bounded-Tree-Width Graphs.

Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018