| Publication | Date of Publication | Type |
|---|
Tangled Paths: A Random Graph Model from Mallows Permutations
(available as arXiv preprint) | N/A | Paper |
Structural Parameters for Dense Temporal Graphs
(available as arXiv preprint) | N/A | Paper |
Reachability in temporal graphs under perturbation
(available as arXiv preprint) | N/A | Paper |
Structural parameters for dense temporal graphs
Journal of Computer and System Sciences | 2027-01-01 | Paper |
Reachability in temporal graphs under perturbation
Theoretical Computer Science | 2026-08-25 | Paper |
| Structural parameters for dense temporal graphs | 2026-05-12 | Paper |
Cops and robbers on multi-layer graphs
Discrete Applied Mathematics | 2026-03-19 | Paper |
Temporal Role Colouring
(available as arXiv preprint) | 2026-01-01 | Paper |
The parameterised complexity of generalised temporal domination on temporal graphs with modular structure
(available as arXiv preprint) | 2026-01-01 | Paper |
The Infectious Vaccination Problem: a variant of Firefighting with Spreading Defence
(available as arXiv preprint) | 2026-01-01 | Paper |
Parameterised algorithms for temporally satisfying reconfiguration problems
Discrete Applied Mathematics | 2026-01-01 | Paper |
Tangled paths: a random graph model from Mallows permutations
The Electronic Journal of Combinatorics | 2025-05-30 | Paper |
Counting temporal paths
Algorithmica | 2025-05-22 | Paper |
| Tangled paths: a random graph model from Mallows permutations (extended abstract) | 2025-04-08 | Paper |
Parameterised algorithms for temporally satisfying reconfiguration problems
(available as arXiv preprint) | 2025-01-01 | Paper |
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
(available as arXiv preprint) | 2025-01-01 | Paper |
Approximating temporal modularity on graphs of small underlying treewidth
(available as arXiv preprint) | 2025-01-01 | Paper |
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
Algorithmica | 2024-10-24 | Paper |
Recognising the overlap graphs of subtrees of restricted trees is hard
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Counting temporal paths | 2024-10-08 | Paper |
| Making life more confusing for firefighters | 2024-05-16 | Paper |
The firebreak problem
Networks | 2023-12-11 | Paper |
Feasibility assessments of a dynamical approach to compartmental modelling on graphs: scaling limits and performance analysis
Theoretical Computer Science | 2023-11-17 | Paper |
| Cops and Robbers on Multi-Layer Graphs | 2023-03-07 | Paper |
Ascertainment rate of SARS-CoV-2 infections from healthcare and community testing in the UK
Journal of Theoretical Biology | 2022-12-20 | Paper |
| Deleting edges to restrict the size of an epidemic in temporal networks | 2022-07-21 | Paper |
The complexity of finding optimal subgraphs to represent spatial correlation
(available as arXiv preprint) | 2022-06-29 | Paper |
| Finding subgraphs with side constraints | 2022-03-21 | Paper |
| Brief announcement: The temporal firefighter problem | 2022-01-01 | Paper |
| Recognising the overlap graphs of subtrees of restricted trees is hard | 2021-12-22 | Paper |
Deleting edges to restrict the size of an epidemic in temporal networks
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Deleting edges to restrict the size of an epidemic in temporal networks
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Assigning times to minimise reachability in temporal graphs
Journal of Computer and System Sciences | 2020-10-23 | Paper |
| Polygon-circle and word-representable graphs | 2019-04-29 | Paper |
Equivalence of the filament and overlap graphs of subtrees of limited trees
(available as arXiv preprint) | 2018-11-30 | Paper |
| Equivalence of the filament and overlap graphs of subtrees of limited trees | 2018-11-30 | Paper |
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Algorithmica | 2018-06-01 | Paper |
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Algorithmica | 2018-06-01 | Paper |
| Building a better Mouse Maze | 2017-07-17 | Paper |
Deleting edges to restrict the size of an epidemic: a new application for treewidth
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Games on interval and permutation graph representations
Theoretical Computer Science | 2015-12-08 | Paper |
On list coloring and list homomorphism of permutation and interval graphs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Subtree filament graphs are subtree overlap graphs
Information Processing Letters | 2010-03-24 | Paper |
