| Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. | 0 | 0.34 | 2021 |
| Deep Weisfeiler Leman | 0 | 0.34 | 2021 |
| An Improved Isomorphism Test for Bounded-tree-width Graphs | 0 | 0.34 | 2020 |
| Stochastic Dominance and the Bijective Ratio of Online Algorithms | 2 | 0.35 | 2020 |
| Space-Efficient Algorithms for Longest Increasing Subsequence. | 0 | 0.34 | 2020 |
| On the Weisfeiler-Leman Dimension of Finite Groups | 0 | 0.34 | 2020 |
| The graph isomorphism problem | 1 | 0.35 | 2020 |
| The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 | 1 | 0.35 | 2019 |
| Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. | 0 | 0.34 | 2019 |
| Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm | 0 | 0.34 | 2019 |
| A Faster Isomorphism Test for Graphs of Small Degree | 2 | 0.41 | 2018 |
| A unifying method for the design of algorithms canonizing combinatorial objects. | 0 | 0.34 | 2018 |
| An exponential lower bound for individualization-refinement algorithms for graph isomorphism | 2 | 0.39 | 2018 |
| Space-Efficient Algorithms for Longest Increasing Subsequence. | 0 | 0.34 | 2018 |
| A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry. | 1 | 0.35 | 2017 |
| Benchmark Graphs for Practical Graph Isomorphism. | 3 | 0.46 | 2017 |
| Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel. | 7 | 0.50 | 2016 |
| Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. | 3 | 0.38 | 2016 |
| Canonizing Graphs of Bounded Tree Width in Logspace. | 9 | 0.48 | 2016 |
| Isomorphism Testing for Graphs of Bounded Rank Width | 18 | 0.72 | 2015 |
| Computing with Tangles. | 3 | 0.41 | 2015 |
| Induced Minor Free Graphs: Isomorphism and Clique-width. | 1 | 0.34 | 2015 |
| Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. | 7 | 0.46 | 2014 |
| Paging and list update under bijective analysis. | 0 | 0.34 | 2013 |
| Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. | 3 | 0.39 | 2013 |
| Online graph exploration: new results on old and new algorithms | 21 | 0.84 | 2012 |
| Weisfeiler-Lehman Graph Kernels | 90 | 2.39 | 2011 |
| An Introduction To Certifying Algorithms | 0 | 0.34 | 2011 |
| Homomorphism–homogeneous graphs | 7 | 0.81 | 2010 |
| Progress on Certifying Algorithms | 2 | 0.40 | 2010 |
| Isomorphism for graphs of bounded feedback vertex set number | 20 | 0.79 | 2010 |
| Paging and list update under bijective analysis | 8 | 0.46 | 2009 |
| Using the incompressibility method to obtain local lemma results for Ramsey-type problems | 3 | 0.84 | 2009 |
| ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm | 0 | 0.34 | 2007 |
