Steven Noble
- Position
- Professor of Theoretical Computer Science
- Areas of expertise
- Combinatorics, Computational Complexity, Delta-matroids, Embedded Graphs, Graph Polynomials
- [email protected]
- Location
- Chemistry West 3.21
- Faculty
- Faculty of Engineering
- School
- School of Computer Science
I joined the University of Leeds in November 2024 after 8 years at Birkbeck, University of London and 18 years at Brunel University, London.
My research intersects computational complexity, algebraic combinatorics and graph theory. In 1997 I obtained my D.Phil from the University of Oxford, supervised by Dominic Welsh - thesis title "The complexity of graph polynomials". Graph polynomials, especially the Tutte polynomial, have remained one of my main research interests. I am particularly interested in the complexity of their evaluation and variants of the Tutte polyonomial for combinatorial objects other than graphs and matroids. For more than 10 years, I have worked extensively on the combinatorics of ribbon graphs, i.e. graphs embedded on surfaces, especially their combinatorial abstraction, namely delta-matroids and their Tutte polynomials.
I look forward to hearing from potential collaborators and PhD students.
Most of my recent papers are available as preprints on the arxiv. Full lists can be found on MathSciNet and zbMATH
