Jake Horsfield

PhD student at the University of Leeds, UK

[email]

Papers

• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
  N. Brettell, J. Horsfield and D. Paulusma
  submitted to Information Processing Letters
• Bounding the mim-width of hereditary graph classes
  N. Brettell, J. Horsfield, A. Munaro, G. Paesani and D. Paulusma
  Proceedings of IPEC 2020. LIPIcs 180, 6:1-6:18
• Two classes of \(\beta\)-perfect graphs that do not necessarily have simplicial extremes
  J. Horsfield and K. Vušković
  Discrete Mathematics 344 (2021)

Teaching

• 2021: Grading for Introduction to Discrete Mathematics (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 to appear]
• ACiD Seminar 02/2020 (Durham) \(\beta\)-perfect graphs that do not necessarily have simplicial extremes [slides]
• Workshop on even-hole-free graphs 04/2019 (Belgrade) \(\beta\)-perfect graphs [slides]

Conferences / workshops / etc.

• Research visit to Durham University, hosted by Daniel Paulusma 25-28 Feb 2020
• Bordeaux Graph Workshop 2019 (Bordeaux)
• Algorithms UK Workshop 2019 (Warwick)
• British Combinatorial Conference 2019 (Birmingham)
• Postgraduate Combinatorial Conference 2019 (Oxford)
• Workshop on even-hole-free graphs 2019 (Belgrade)

Other

• Together with Ben Bumpus, Ethan Kelly and Michael McKay, I am an organiser of the e-PCC seminar, an online seminar series for PhD students and postdocs working in discrete mathematics and combinatorics.