I am currently a Teaching Fellow working within the School of Computing & Mathematical Sciences at the University of Leicester.
I received a BSc in Computer Networks from the University of Derby in 2016 and an MSc in Computer Science from the University of Leicester in 2017. Under the supervision of Prof. Thomas Erlebach I studied for a PhD in Computer Science (Algorithm Design & Analysis) at the University of Leicester. I successfully defended my thesis in November 2021.
My research so far has largely been involved with temporal graphs (graphs whose edge set can differ over the course of discrete time). In particular I have been considering the problem of exploring temporal graphs (i.e. visiting each vertex of some given temporal graph at least once by means of a 'time-respecting' walk). More generally I am interested in the following topics:
- Design and analysis of graph/temporal graph algorithms
- Graph theory
- Fixed-parameter algorithms
- Analysing the complexity of combinatorial problems
I am also interested in traditional Computer Networks and modern networking paradigms for example Software Defined Networking.
(0) Erlebach T., Spooner J.T. (2021) Exploration of k-Edge-Deficient Temporal Graphs. In: Lubiw A., Salavatipour M. (eds) Algorithms and Data Structures. WADS 2021. Lecture Notes in Computer Science, vol 12808. Springer, Cham.
Erlebach T., Spooner J.T. (2020) Non-strict Temporal Exploration. In: Richa A., Scheideler C. (eds) Structural Information and Communication Complexity. SIROCCO 2020. Lecture Notes in Computer Science, vol 12156. Springer, Cham.
Erlebach T., Spooner J.T. (2020) A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. In: Chatzigeorgiou A. et al. (eds) SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science, vol 12011. Springer, Cham
Erlebach, T., Kammer, F., Luo, K., Sajenko, A., & Spooner, J. T. (2019). Two Moves per Time Step Make a Difference. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Erlebach, T. and Spooner, J.T. (2018). Faster Exploration of Degree-Bounded Temporal Graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
I would be happy to supervise PhD students that are interested in undertaking any algorithms-related projects. More specifically any projects that aim to establish the complexity of graph/temporal graph problems or aim to design provably efficient algorithms for these problems would be of interest to me.
I currently teach the UML & 'git' portion of ""CO1106: Requirements Engineering & Professional Practice"". I have also recently assisted with ""MA2252: Introduction to Computing"" and ""CO7210: Personal and Group Skills"".
In the past as a TA I was involved with modules covering a variety of topics such as: fundamental discrete mathematics (sets proof writing relations graphs etc.) relational database theory/SQL introductory procedural/object oriented programming and algorithms (basic graph algorithms asymptotic notation fundamental data structures etc.).