| Academic Staff |
| Magnus Bordewich |
counting problems; randomised algorithms; Markov Chain Monte Carlo sampling techniques; phylogenetics. |
| Stefan Dantchev |
computational complexity; proof complexity; logic; constraint satisfaction; SAT solving. |
| Tom Friedetzky |
randomised algorithms; probabilistic analysis; sub-linear time algorithms; load balancing. |
| Maximilien Gadouleau |
coding theory, network coding and information theory, combinatorics, graph theory, discrete optimisation, matroid theory, logic, group theory. |
| Matthew Johnson |
graph theory including colouring, algorithms and decompositions; combinatorial optimization. |
| Andrei Krokhin |
constraint satisfaction, combinatorial optimization, universal algebra, logic, finite model theory. |
| George Mertzios |
algorithms and complexity, foundations of networks, combinatorial optimization and algorithmic game theory. |
| Daniel Paulusma |
graph theory and algorithms; combinatorial optimization; cooperative game theory. |
| Iain Stewart |
finite model theory, descriptive complexity; graph theory and algorithms; interconnection networks.
Norbert Peyerimhoff
(Department of Mathematical Sciences) |
spectral geometry, schrodinger operators, symmetric spaces, dynamical systems, graph theory.
|
| Research Staff |
| Konrad Dąbrowski |
graph algorithms |
| Nicholas Georgiou |
probabilistic combinatorics and partial orders; modular decomposition and its connection to the Reconstruction Conjecture. |
| Anna Huber |
randomized and combinatorial methods, discrete mathematics, graph theory, algebra |
| Research Students |
| Laurence Dawson |
James Gate |
Ioannis Lignos |
| Foad Lotfifar |
Sepehr Meshkinfamfard |
Robert Powell |
| Jian Song |
Adam Symonds |
Dan Thomas |
| William Whistler |
|
|
