Daniel Wiebking

15 papers A* 6Journal 9

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