I am a PhD student in the ACiD (Algorithms and Complexity in Durham) group supervised by Dr Barnaby Martin and Professor Daniel Paulusma .
My primary research interest lies in graph theory, particularly from a structural and algorithmic perspective, considering the impact of structural restrictions on the computational complexity of graph problems.
T. Eagling-Vose, B. Martin, D. Paulusma, M. Siggers, S. Smith, Graph Homomorphism, Monotone Classes and Bounded Pathwidth, preprint, 2024. [arXiv]
Graph Homomorphisms, Colouring Games, and Forbidden Subgraphs , BCTCS 2024, Bath, UK, April 2024
PhD, Computer Science, Durham University, October 2023-present
Graph Problems with Restricted Inputs; supervised by Dr Barnaby Martin and Professor Daniel Paulusma.
BSc, Computer Science, Durham University, September 2020-June 2023
First class degree; Final year project conserned Optimal and Delay Robust Paths in Temporal Graphs supervised by Dr Eleni Akrida.
Computer Science Demonstrator, Durham University, October 2022-present
Theory of Computation (3rd year students) - models of computation, basic computability theory, algorithm design and Computational complexity
Algorithms and Data Structures (2nd year students) (algorithm design and analysis, and basic data structures) to undergraduate students.