| Publication | Date of Publication | Type |
|---|
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
(available as arXiv preprint) | N/A | Paper |
Untangling Gaussian Mixtures
(available as arXiv preprint) | N/A | Paper |
| Logarithmic Weisfeiler-Leman identifies all planar graphs | 2026-05-12 | Paper |
| The iteration number of colour refinement | 2026-03-18 | Paper |
| Simulating logspace-recursion with logarithmic quantifier depth | 2026-02-27 | Paper |
| Verification of population protocols with unordered data | 2026-01-14 | Paper |
| Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees | 2025-06-18 | Paper |
| Untangling Gaussian mixtures | 2025-05-02 | Paper |
| Polyregular functions: characterisations and refutations | 2025-01-31 | Paper |
| Treelike decompositions for transductions of sparse graphs | 2024-12-06 | Paper |
| A study of Weisfeiler-Leman colorings on planar graphs | 2024-06-24 | Paper |
| Simulating Logspace-Recursion with Logarithmic Quantifier Depth | 2023-04-25 | Paper |
Graphs Identified by Logics with Counting
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
String-to-string interpretations with polynomial-size output
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561610 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs | 2022-07-21 | Paper |
| A Study of Weisfeiler-Leman Colorings on Planar Graphs | 2022-06-21 | Paper |
The power of the Weisfeiler-Leman algorithm to decompose graphs
SIAM Journal on Discrete Mathematics | 2022-02-09 | Paper |
| Treelike decompositions for transductions of sparse graphs | 2022-01-26 | Paper |
| Logarithmic Weisfeiler-Leman Identifies All Planar Graphs | 2021-06-30 | Paper |
| The Weisfeiler-Leman dimension of planar graphs is at most 3 | 2021-01-19 | Paper |
| The Iteration Number of Colour Refinement | 2020-05-20 | Paper |
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
Journal of the ACM | 2020-02-11 | Paper |
Upper bounds on the quantifier depth for graph differentiation in first-order logic
Logical Methods in Computer Science | 2019-07-12 | Paper |
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus
(available as arXiv preprint) | 2019-04-15 | Paper |
Upper bounds on the quantifier depth for graph differentiation in first order logic
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Graphs identified by logics with counting
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
