Profile: Nick Sheppard

Nick Sheppard decided to do a PhD in computer science after working as a programmer and finding that it wasn't challenging enough for him. In Nick's research, he tries to prove that algorithms have various properties so that they can be implemented in computer programming. This has given Nick the opportunity to undertake research within computing and mathematics concurrently.

The particular problems he's been looking at are called Graph Colouring Problems and Steiner Trees. Both are used in programs that are related to resource allocation. For example, Graph Colouring is often used for making examination timetables, or allocating radio frequencies, and is used to determine the most efficient usage, without clashes. Similarly, Steiner Trees are used in network layout problems, like creating the cheapest possible network between a given number of points. Specifically, Nick has been concerned with preprocessing of these problems.

Nick says that he enjoys his work because he finds it a constant challenge. When you prove a theorem that no-one has ever proven before, you can get a great sense of satisfaction - an essential element in the kind of career that I'm after.