| Publication | Date of Publication | Type |
|---|
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
(available as arXiv preprint) | N/A | Paper |
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
(available as arXiv preprint) | N/A | Paper |
| Treedepth inapproximability and exponential eth lower bound | 2026-09-23 | Paper |
Approximate monotone local search for weighted problems
Algorithmica | 2026-09-21 | Paper |
| Robust contraction decomposition for minor-free graphs and its applications | 2026-09-10 | Paper |
Can you link up with treewidth?
Journal of Computer and System Sciences | 2026-09-07 | Paper |
| Counting small induced subgraphs: scorpions are easy but not trivial | 2026-08-31 | Paper |
| Can you link up with treewidth? | 2026-06-24 | Paper |
Isomorphism for tournaments of small twin width
TheoretiCS | 2026-03-23 | Paper |
| Hypergraph isomorphism for groups with restricted composition factors | 2026-03-18 | Paper |
| The iteration number of the Weisfeiler-Leman algorithm | 2026-02-27 | Paper |
| Isomorphism for tournaments of small twin width | 2026-01-14 | Paper |
| Homomorphism-distinguishing closedness for graphs of bounded tree-width | 2025-11-10 | Paper |
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
ACM Transactions on Algorithms | 2025-10-01 | Paper |
| Approximate monotone local search for weighted problems | 2025-09-24 | Paper |
Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements
Journal of the ACM | 2025-08-21 | Paper |
| Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements | 2025-08-15 | Paper |
| Isomorphism testing for graphs excluding small minors | 2025-08-12 | Paper |
| A faster isomorphism test for graphs of small degree | 2025-08-12 | Paper |
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
ACM Transactions on Computation Theory | 2025-08-01 | Paper |
| Faster exponential-time approximation algorithms using approximate monotone local search | 2025-06-19 | Paper |
| Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees | 2025-06-18 | Paper |
Isomorphism testing for graphs excluding small topological subgraphs
ACM Transactions on Algorithms | 2025-02-21 | Paper |
The iteration number of the Weisfeiler-Leman algorithm
ACM Transactions on Computational Logic | 2025-02-14 | Paper |
| Canonisation and definability for graphs of bounded rank width | 2024-12-19 | Paper |
| Optimally repurposing existing algorithms to obtain exponential-time approximations | 2024-11-28 | Paper |
| Isomorphism testing for graphs excluding small topological subgraphs | 2024-07-19 | Paper |
| A framework for parameterized subexponential algorithms for generalized cycle hitting problems on planar graphs | 2024-07-19 | Paper |
| A study of Weisfeiler-Leman colorings on planar graphs | 2024-06-24 | Paper |
| Computing square colorings on bounded-treewidth and planar graphs | 2024-05-14 | Paper |
| Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs | 2024-05-14 | Paper |
Isomorphism Testing Parameterized by Genus and Beyond
SIAM Journal on Discrete Mathematics | 2024-02-07 | Paper |
A Faster Isomorphism Test for Graphs of Small Degree
SIAM Journal on Computing | 2023-12-19 | Paper |
Hypergraph Isomorphism for Groups with Restricted Composition Factors
ACM Transactions on Algorithms | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7740927 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
| Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width | 2023-04-14 | Paper |
Isomorphism Testing for Graphs Excluding Small Minors
SIAM Journal on Computing | 2023-04-04 | Paper |
Canonisation and Definability for Graphs of Bounded Rank Width
ACM Transactions on Computational Logic | 2023-02-07 | Paper |
Recent advances on the graph isomorphism problem
(available as arXiv preprint) | 2022-11-18 | Paper |
| Recent advances on the graph isomorphism problem | 2022-11-18 | 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 |
An improved isomorphism test for bounded-tree-width graphs
(available as arXiv preprint) | 2021-07-28 | Paper |
An improved isomorphism test for bounded-tree-width graphs
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Benchmark Graphs for Practical Graph Isomorphism
(available as arXiv preprint) | 2020-05-27 | Paper |
Subgroups of 3-factor direct products
Tatra Mountains Mathematical Publications | 2019-09-30 | Paper |
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Graph isomorphism for unit square graphs
(available as arXiv preprint) | 2018-03-02 | Paper |
Subgroups of 3-factor direct products
(available as arXiv preprint) | 2016-07-12 | Paper |
