I am a PhD student in the ACiD (Algorithms and Complexity in Durham) group supervised by Dr Barnaby Martin and Professor Daniël 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.
I will soon be finishing my PhD. If you are looking for a Post Doc and my work seems interesting to you, get in touch!PhD, Computer Science, Durham University,
October 2023-present
Graph Problems with Restricted Inputs; supervised by Dr Barnaby Martin and Professor Daniël Paulusma.
BSc, Computer Science, Durham University,
October 2020-June 2023
First class degree; Thesis on Optimal and Delay Robust Paths in Temporal Graphs under Dr Eleni Akrida.
Preprint
B. Bumpus, R. Downey, T. Eagling-Vose, J. Enright, M. Fellows, D. Kutner, L. Larios-Jones, B. Martin, F. Rosamond, E. Yates, O(n +f(k)): Truly Linear FPT, Preprint, 2026 (to appear IPEC 2026). [arXiv]
T. Eagling-Vose, D. Kutner, F. Lucke, D. Marx, B. Martin, D. Paulusma, E. J. van Leeuwen:, Steiner Forest for H-Subgraph-Free Graphs, Preprint, 2026. [arXiv]
T. Eagling-Vose, B. Martin, D. Paulusma, N. Trotignon, On Detecting H-Induced Minors for Small H, Preprint, 2026. [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
T. Eagling-Vose, J. Jooken, F. Lucke, B. Martin, D. Paulusma, S. Smith, Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification, WG, 2026. [arXiv] [WG 2026]
J. Ahn, T. Eagling-Vose, F. Lucke, D. Manlove, F. Mendoza-Granada, D. Paulusma, Optimal b-Colourings and Fall Colourings in H-Free Graphs, WG, 2026. [arXiv] [WG 2026]
K. Asimi, T. Eagling-Vose, S. Guzmán-Pro, B. Martin, Y. Qiu, Quantified Colouring and H-Free Algorithmics, SOFSEM, 2026. [SOFSEM 2026]
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]
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.
WG 2026, Kortrijk, Belgium, June 2026
FATA seminar, Glasgow, UK, January 2026
ACID seminar, Durham, UK, November 2025
Colouring and the Forbidden "H" Graph.
WG 2026, Kortrijk, Belgium, June 2026
FATA seminar, Glasgow, UK, January 2026
ACID seminar, Durham, UK, November 2025
Bounding Width on Graph Classes of Constant Diameter.
FCT 2025, Wrocław, Poland, September 2025
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.