| Publication | Date of Publication | Type |
|---|
Fast winning strategies for the attacker in eternal domination
(available as arXiv preprint) | N/A | Paper |
The Maker-Breaker Largest Connected Subgraph Game
(available as arXiv preprint) | N/A | Paper |
Poset Positional Games
(available as arXiv preprint) | N/A | Paper |
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
(available as arXiv preprint) | N/A | Paper |
Computing the degreewidth of a digraph is hard
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-10-02 | Paper |
| On the complexity of client-waiter and waiter-client games | 2026-09-29 | Paper |
| On the complexity of vertex-splitting into an interval graph | 2026-09-29 | Paper |
| An algorithm for monitoring edge-geodetic sets in chordal graphs | 2026-09-29 | Paper |
On the complexity of the Maker-Breaker happy vertex game
(available as arXiv preprint) | 2026-01-01 | Paper |
On the parameterized complexity of the Maker-Breaker domination game
(available as arXiv preprint) | 2026-01-01 | Paper |
Token positional games
(available as arXiv preprint) | 2026-01-01 | Paper |
Exact number of flips required to sort a burnt stack of pancakes
(available as arXiv preprint) | 2026-01-01 | Paper |
A two-player version of the assignment problem
(available as arXiv preprint) | 2026-01-01 | Paper |
Stable Set Reconfiguration in Dense Digraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
| Bounded degree QBF and positional games | 2025-11-11 | Paper |
| Fast winning strategies for the attacker in eternal domination | 2025-05-02 | Paper |
Poset positional games
Discrete Mathematics | 2025-04-11 | Paper |
Complexity of maker-breaker games on edge sets of graphs
Discrete Applied Mathematics | 2025-01-06 | Paper |
Graph Irregularity via Edge Deletions
(available as arXiv preprint) | 2025-01-01 | Paper |
| Avoidance games are PSPACE-complete | 2024-10-08 | Paper |
On the parameterized complexity of non-hereditary relaxations of clique
Theoretical Computer Science | 2024-06-04 | Paper |
The maker-maker domination game in forests
Discrete Applied Mathematics | 2024-03-27 | Paper |
Bipartite instances of INFLUENCE
Theoretical Computer Science | 2024-02-23 | Paper |
On the complexity of Client-Waiter and Waiter-Client games
(available as arXiv preprint) | 2024-01-01 | Paper |
Computing the degreewidth of a digraph is hard
(available as arXiv preprint) | 2024-01-01 | Paper |
Bounded degree QBF and positional games
(available as arXiv preprint) | 2024-01-01 | Paper |
The maker-breaker largest connected subgraph game
Theoretical Computer Science | 2023-01-05 | Paper |
| Incidence, a Scoring Positional Game on Graphs | 2022-11-02 | Paper |
| Avoidance games are PSPACE-Complete | 2022-09-23 | Paper |
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
(available as arXiv preprint) | 2021-09-28 | Paper |
