I was a trainee patent attorney in the Tech group at Kilburn & Strode. Before that, I completed a PhD in structural graph theory. I was supervised by Professor Kristina Vušković

<aside>

[Email] ~ [LinkedIn] ~ [GitHub] ~ [ORCID] ~ [Google Scholar] ~ [Substack]

</aside>

Papers

• Beta-perfect extended pyramids. Work in progress. Please get in touch if you'd be interested in collaborating!
• Claw-free beta-perfect graphs with K. Vušković Accepted for publication in Discrete Mathematics.
• Graphs with all holes the same length with L. Cook, M. Preissmann, C. Robin, P. Seymour, N. L. D. Sintiari, N. Trotignon and K. Vušković Journal of Combinatorial Theory, Series B (2024).
• Colouring P_t-free graphs: a mim-width perspective with N. Brettell and D. Paulusma Information Processing Letters (2022).
• Bounding the mim-width of hereditary graph classes with N. Brettell, A. Munaro, G. Paesani and D. Paulusma Journal of Graph Theory (2021).
• Two classes of beta-perfect graphs that do not necessarily have simplicial extremes with K. Vušković Discrete Mathematics (2021).

Teaching

• 2021: TA for Algorithms & Data Structures 1 (Level 2) and Fundamental Mathematical Concepts (Level 1)
• 2020: TA for Graph Theory: Structure and Algorithms (Masters level)
• 2020: TA for Introduction to Discrete Mathematics (Level 1)
• 2019: TA for Algorithms & Data Structures 1 (Level 2)
• 2019: TA for Introduction to Discrete Mathematics (Level 1)

Talks

• Algorithms and Complexity Seminar 03/2021 (Leeds) Variations on 2-joins [slides]
• ACiD Seminar 02/2020 (Durham)
• Beta-perfect graphs that do not necessarily have simplicial extremes [slides]