| Publication | Date of Publication | Type |
|---|
Time-delayed cops and robbers Discrete Applied Mathematics | 2024-12-04 | Paper |
The frustum network model based on clique extension Journal of Combinatorial Optimization | 2024-11-28 | Paper |
Subgraph games in the semi-random graph process and its generalization to hypergraphs The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
Rainbow thresholds SIAM Journal on Discrete Mathematics | 2024-09-17 | Paper |
The localization number of designs Journal of Combinatorial Designs | 2024-02-01 | Paper |
| The $k$-visibility Localization Game | 2023-11-02 | Paper |
The one-visibility localization game Theoretical Computer Science | 2023-10-12 | Paper |
An evolving network model from clique extension Lecture Notes in Computer Science | 2023-08-10 | Paper |
The localization game on oriented graphs Discrete Applied Mathematics | 2023-08-02 | Paper |
scientific article; zbMATH DE number 7720720 (Why is no real title available?) (available as arXiv preprint) | 2023-08-01 | Paper |
| scientific article; zbMATH DE number 7720720 (Why is no real title available?) | 2023-08-01 | Paper |
The iterated local transitivity model for hypergraphs Discrete Applied Mathematics | 2023-06-15 | Paper |
Computing Autotopism Groups of Partial Latin Rectangles ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Pursuit-evasion games on Latin square graphs Journal of Combinatorics | 2023-04-19 | Paper |
The iterated local directed transitivity model for social networks Lecture Notes in Computer Science | 2022-10-14 | Paper |
| Tic-Tac-Toe on an affine plane of order 4 | 2022-05-31 | Paper |
Tic-Tac-Toe on an affine plane of order 4 (available as arXiv preprint) | 2022-05-31 | Paper |
The localization capture time of a graph Theoretical Computer Science | 2022-03-23 | Paper |
Tight bounds on probabilistic zero forcing on hypercubes and grids The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
| On Meyniel extremal families of graphs | 2022-01-21 | Paper |
Pursuit-evasion games on latin square graphs (available as arXiv preprint) | 2021-09-29 | Paper |
The game of cops and eternal robbers Theoretical Computer Science | 2021-06-22 | Paper |
The localization capture time of a graph (available as arXiv preprint) | 2021-05-20 | Paper |
| Rainbow Thresholds | 2021-04-12 | Paper |
| Progress on the localization number of a graph | 2021-03-18 | Paper |
Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids (available as arXiv preprint) | 2020-11-30 | Paper |
Balanced equi-\(n\)-squares The Electronic Journal of Combinatorics | 2020-10-20 | Paper |
Refining invariants for computing autotopism groups of partial Latin rectangles Discrete Mathematics | 2020-03-20 | Paper |
The Game of Cops and Eternal Robbers (available as arXiv preprint) | 2020-03-08 | Paper |
| Computing autotopism groups of partial Latin rectangles: a pilot study | 2019-10-22 | Paper |
The enumeration of cyclic mutually nearly orthogonal Latin squares Journal of Combinatorial Designs | 2019-07-30 | Paper |
Covers and partial transversals of Latin squares Designs, Codes and Cryptography | 2019-05-17 | Paper |
| Two-line graphs of partial Latin rectangles | 2018-10-11 | Paper |
On the intersection of three or four transversals of the back circulant Latin squares The Australasian Journal of Combinatorics | 2016-09-14 | Paper |
On the intersection of three or four transversals of the back circulant Latin squares The Australasian Journal of Combinatorics | 2016-09-14 | Paper |
| The Enumeration of Cyclic MNOLS | 2015-12-03 | Paper |
The spectrum for 3-way \(k\)-homogeneous Latin trades The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs (available as arXiv preprint) | N/A | Paper |
How to cool a graph (available as arXiv preprint) | N/A | Paper |
Tic-Tac-Toe on Designs (available as arXiv preprint) | N/A | Paper |
Locally finite graphs and their localization numbers (available as arXiv preprint) | N/A | Paper |