| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147412 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147523 | 2024-01-15 | Paper |
| A Faster Isomorphism Test for Graphs of Small Degree | 2023-12-19 | Paper |
| Parallel Computation of Combinatorial Symmetries. | 2023-09-20 | Paper |
| Graphs Identified by Logics with Counting | 2022-12-08 | Paper |
| Choiceless Polynomial Time with Witnessed Symmetric Choice | 2022-05-27 | Paper |
| A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension | 2021-11-23 | Paper |
| An improved isomorphism test for bounded-tree-width graphs | 2021-07-28 | Paper |
| An Improved Isomorphism Test for Bounded-tree-width Graphs | 2021-05-03 | Paper |
| Engineering a Fast Probabilistic Isomorphism Test | 2021-01-27 | Paper |
| On the Weisfeiler-Leman Dimension of Finite Groups | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144654 | 2021-01-19 | Paper |
| Automorphism groups of graphs of bounded Hadwiger number | 2020-12-28 | Paper |
| Classification of Finite Highly Regular Vertex-Coloured Graphs | 2020-12-02 | Paper |
| Space-Efficient Algorithms for Longest Increasing Subsequence | 2020-08-05 | Paper |
| A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry | 2020-05-27 | Paper |
| Benchmark Graphs for Practical Graph Isomorphism | 2020-05-27 | Paper |
| Space-efficient algorithms for longest increasing subsequence | 2020-04-15 | Paper |
| Stochastic dominance and the bijective ratio of online algorithms | 2020-04-01 | Paper |
| The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 | 2020-02-11 | Paper |
| A unifying method for the design of algorithms canonizing combinatorial objects | 2020-01-30 | Paper |
| Canonizing Graphs of Bounded Tree Width in Logspace | 2019-12-06 | Paper |
| Subgroups of 3-Factor Direct Products | 2019-09-30 | Paper |
| ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm | 2019-09-11 | Paper |
| An exponential lower bound for individualization-refinement algorithms for graph isomorphism | 2019-08-22 | Paper |
| Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic | 2019-07-12 | Paper |
| Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm | 2019-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633928 | 2019-05-06 | Paper |
| Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic | 2018-04-23 | Paper |
| Induced minor free graphs: isomorphism and clique-width | 2018-02-28 | Paper |
| Towards an isomorphism dichotomy for hereditary graph classes | 2018-02-01 | Paper |
| Canonizing Graphs of Bounded Tree Width in Logspace | 2018-01-24 | Paper |
| Minimal asymmetric graphs | 2017-09-29 | Paper |
| Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink | 2017-07-12 | Paper |
| Towards an Isomorphism Dichotomy for Hereditary Graph Classes | 2017-01-24 | Paper |
| Graph isomorphism for graph classes characterized by two forbidden induced subgraphs | 2016-11-24 | Paper |
| Induced minor free graphs: isomorphism and clique-width | 2016-10-21 | Paper |
| Subgroups of 3-factor direct products | 2016-07-12 | Paper |
| Computing with Tangles | 2016-06-23 | Paper |
| On quasioutomorphism groups of free groups and their transitivity properties | 2016-01-29 | Paper |
| Graphs Identified by Logics with Counting | 2015-09-16 | Paper |
| Depth-First Search Using $$O(n)$$ Bits | 2015-09-11 | Paper |
| A linear-time algorithm for testing outer-1-planarity | 2015-09-02 | Paper |
| Computing with Tangles | 2015-08-21 | Paper |
| Isomorphism Testing for Graphs of Bounded Rank Width | 2015-05-14 | Paper |
| Certifying algorithms | 2014-10-24 | Paper |
| Reduction Techniques for Graph Isomorphism in the Context of Width Parameters | 2014-09-02 | Paper |
| Switching Reconstruction of Digraphs | 2014-08-07 | Paper |
| Competition Numbers, Quasi-line Graphs, and Holes | 2014-06-19 | Paper |
| Iterated open neighborhood graphs and generalizations | 2014-04-16 | Paper |
| Paging and list update under bijective analysis | 2014-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396694 | 2014-02-03 | Paper |
| On zero divisors with small support in group rings of torsion-free groups | 2014-01-23 | Paper |
| Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes | 2014-01-14 | Paper |
| A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system | 2014-01-13 | Paper |
| A Linear-Time Algorithm for Testing Outer-1-Planarity | 2013-12-20 | Paper |
| Connecting face hitting sets in planar graphs | 2013-04-04 | Paper |
| Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time | 2013-04-03 | Paper |
| Online graph exploration: New results on old and new algorithms | 2013-01-07 | Paper |
| Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs | 2012-11-06 | Paper |
| Isomorphism of (mis)Labeled Graphs | 2011-09-16 | Paper |
| Online Graph Exploration: New Results on Old and New Algorithms | 2011-07-07 | Paper |
| Homomorphism-homogeneous graphs | 2011-01-19 | Paper |
| Progress on Certifying Algorithms | 2010-09-07 | Paper |
| Isomorphism for Graphs of Bounded Feedback Vertex Set Number | 2010-06-22 | Paper |
| Using the incompressibility method to obtain local Lemma results for Ramsey-type problems | 2010-06-16 | Paper |
| Counting defective parking functions | 2009-04-07 | Paper |
| The co-word problem for the Higman-Thompson group is context-free | 2007-07-12 | Paper |
| Context-Freeness of Higman-Thompson group's co-word problem | 2005-07-05 | Paper |
