| Publication | Date of Publication | Type |
|---|
| Parallel complexity of identifying groups and quasigroups via decompositions | 2026-06-23 | Paper |
| Complexity of identifying fitting-free groups | 2026-02-26 | Paper |
| Complexity of minimal faithful permutation degree for fitting-free groups | 2026-02-26 | Paper |
On the descriptive complexity of groups without abelian normal subgroups
Logical Methods in Computer Science | 2026-02-13 | Paper |
Comer schemes, relation algebras, and the flexible atom conjecture
Fundamenta Informaticae | 2026-01-22 | Paper |
Moments of colored permutation statistics on conjugacy classes
Annals of Combinatorics | 2026-01-19 | Paper |
On the parallel complexity of group isomorphism via Weisfeiler-Leman
Journal of Computer and System Sciences | 2025-12-11 | Paper |
| Pairwise rearrangement is fixed-parameter tractable in the single cut-and-join model | 2025-12-02 | Paper |
| Canonizing graphs of bounded rank-width in parallel via Weisfeiler-Leman | 2025-12-02 | Paper |
Pairwise rearrangement is fixed-parameter tractable in the single cut-and-Join model
Theoretical Computer Science | 2025-11-01 | Paper |
On the constant-depth circuit complexity of generating quasigroups
TheoretiCS | 2025-10-22 | Paper |
| On the descriptive complexity of groups without abelian normal subgroups (extended abstract) | 2025-08-19 | Paper |
| Constant depth circuit complexity for generating quasigroups | 2025-02-03 | Paper |
Complexity and enumeration in models of genome rearrangement
Theoretical Computer Science | 2024-12-02 | Paper |
| Complexity and enumeration in models of genome rearrangement | 2024-08-22 | Paper |
Count-free Weisfeiler-Leman and group isomorphism
International Journal of Algebra and Computation | 2024-05-29 | Paper |
Activity in Boolean networks
Natural Computing | 2024-02-09 | Paper |
Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
International Journal of Algebra and Computation | 2024-01-04 | Paper |
On the complexity of identifying strongly regular graphs
(available as arXiv preprint) | 2023-11-29 | Paper |
| On the complexity of identifying strongly regular graphs | 2023-11-29 | Paper |
Comer schemes, relation algebras, and the flexible atom conjecture
Relational and Algebraic Methods in Computer Science | 2023-08-17 | Paper |
| Moments of Colored Permutation Statistics on Conjugacy Classes | 2023-05-19 | Paper |
| Complexity and Enumeration in Models of Genome Rearrangement | 2023-05-02 | Paper |
| Logarithmic Weisfeiler--Leman and Treewidth | 2023-03-14 | Paper |
| Permutation Statistics in Conjugacy Classes of the Symmetric Group | 2023-01-02 | Paper |
Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)
Algebra Universalis | 2022-08-01 | Paper |
| On the parallel complexity of Group Isomorphism via Weisfeiler-Leman | 2021-12-21 | Paper |
Improved bounds on the size of the smallest representation of relation algebra $32_{65}$
(available as arXiv preprint) | 2019-11-01 | Paper |
Network structure and activity in Boolean networks
Cellular Automata and Discrete Complex Systems | 2015-08-07 | Paper |
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
(available as arXiv preprint) | N/A | Paper |
On the Constant-Depth Circuit Complexity of Generating Quasigroups
(available as arXiv preprint) | N/A | Paper |
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
(available as arXiv preprint) | N/A | Paper |
Count-Free Weisfeiler--Leman and Group Isomorphism
(available as arXiv preprint) | N/A | Paper |
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
(available as arXiv preprint) | N/A | Paper |
