Dr. Steven
NOBLE
PERSONAL DETAILS
Nationality: British
Date of Birth: 7 December 1971
E-mail: Steven.Derek.Noble@brunel.ac.uk
ACADEMIC/PROFESSIONAL QUALIFICATIONS
1997 D.Phil title Complexity of Graph Polynomials.
New College, Oxford.
1993 B.A. Mathematics. (1st Class Honours)
New College, Oxford.
EMPLOYMENT HISTORY
1998-Date Lecturer. Department of Mathematics and Statistics.
Brunel University.
1997-1998 Stipendiary Lecturer in Pure Mathematics.
Merton College, Oxford.
1996-1997 Stipendiary Lecturer in Mathematics.
New College, Oxford.
RESEARCH INTERESTS
Complexity of counting problems in graph theory particularly evaluations of polynomials.
Graph colouring problems motivated by the Frequency Assignment Problem.
Graph problems arising in the design of distributed networks.
GRANTS
1999 BRIEF award: Performance Engineering of Distributed Systems.
PUBLICATIONS
Recognizing a partitionable simplicial complex is in NP. Discrete Mathematics 152 (1996) 303-305.
Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics, Probability and Computing 7 (1998) 303-323.
A Weighted graph polynomial from chromatic invariants of knots. With D.J.A.Welsh. Annales de l’Institute Fourier 49 (1999).
Reidemeister moves on graphs. With D.J.A. Welsh. To appear in Journal of Graph Theory.
Optimal Arrangement of Data in a Tree Directory. With M.J. Luczak. Submitted to Discrete Applied Mathematics.