Jake Horsfield
- Email: sc15jh@leeds.ac.uk
- Thesis title: Structural characterisations of hereditary graph classes and algorithmic consequences
Profile
Papers
- Colouring (sP_1+P_5)-free graphs: a mim-width perspective
N. Brettell, J. Horsfield and D. Paulusma
submitted - Bounding the mim-width of hereditary graph classes
N. Brettell, J. Horsfield, A. Munaro, G. Paesani and D. Paulusma
in preparation - Two classes of β-perfect graphs that do not necessarily have simplicial extremes
J. Horsfield and K. Vušković
submitted to Discrete Mathematics
Teaching
- 2020: TA for Graph Theory: Structure and Algorithms
- 2020: TA for Introduction to Discrete Mathematics
- 2019: TA for Algorithms & Data Structures 1
- 2019: TA for Introduction to Discrete Mathematics
Research interests
Structural graph theory,
graph colouring,
even-hole-free graphs.
Qualifications
- BSc Computer Science
Research groups and institutes
- Algorithms and Complexity