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.
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 concerned Optimal and Delay Robust Paths in Temporal Graphs supervised by Dr Eleni Akrida.
preprint
T. Eagling-Vose, J. Jooken, F. Lucke, B. Martin, D. Paulusma, S. Smith, Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification, Preprint, 2025. [arXiv]
T. Eagling-Vose, B. Martin, D. Paulusma, S. Smith, A forbidden subgraph study for cut problems on graphs permitting loops and multiedges, Preprint, 2025. [arXiv]
conference publications
J. Ahn, T. Eagling-Vose, F. Lucke, D. Paulusma, S. Smith, Finding d-Cuts in Claw-free Graphs, ISAAC, 2025. [arXiv] [ISAAC 2025]
K. Dabrowski, T. Eagling-Vose, M Johnson, G. Paesani, D. Paulusma, Finding d-Cuts in Probe H-Free Graphs, FCT, 2025. [arXiv] [FCT 2025] https://link.springer.com/chapter/10.1007/978-3-032-04700-7_9
K. Dabrowski, T. Eagling-Vose, N. Köhler, S. Ordyniak, D. Paulusma, Bounding Width on Graph Classes of Constant Diameter, WG, 2025. [arXiv] [WG 2025]
T. Eagling-Vose, B. Martin, D. Paulusma, S. Smith, Graph Homomorphism, Monotone Classes and Bounded Pathwidth, CIE, 2024. [arXiv] [CIE 2024]
Colouring and the Forbidden "H" Graph
FATA seminar, Glasgow, UK, January 2026
ACID seminar, Durham, UK, November 2025
Bounding Width on Graph Classes of Constant Diameter
WG 2025, Otzenhausen, Germany, June 2025
PCC 2025, Glasgow, Scotland, May 2025
ACID seminar, Durham, UK, November 2024
Graph Homomorphism, Monotone Classes and Bounded Pathwidth ,
CIE 2024, Amsterdam, Netherlands, July 2024
BCTCS 2024, Bath, UK, April 2024
Computer Science Demonstrator, Durham University, October 2022-present
Theory of Computation (2nd year students) - models of computation, basic computability theory, algorithm design and Computational complexity
Algorithms and Data Structures (1st year students) (algorithm design and analysis, and basic data structures) to undergraduate students.