Home > Department of Mathematics > Research > Discrete Mathematics and Algorithms
How to contact us

Department of Mathematics
Columbia House
London School of Economics
Houghton Street
London WC2A 2AE, UK


Email: maths.info@lse.ac.uk
Tel: +44(0)207 955 7732/7925
Connect with LSE Maths: Twitter


Click here for information on how to get to LSE using public transport and maps of the campus

Discrete Mathematics and Algorithms

The LSE Mathematics Department has a strong faculty working in various topics in Discrete Mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has been highlighted by recent EPSRC Reviews of both disciplines as being one of increasing importance, and LSE is well placed to be at the forefront of future developments.  


Dr Peter Allen - Assistant Professor

  • Extremal and random combinatorics; in particular Ramsey theory
  • Extremal (hyper)graph theory
  • Extremal theorems on (quasi)random structures, and algorithmic aspects thereof
Anthony, Martin

Prof Martin Anthony - Professor

  • Mathematical aspects of machine learning, particularly probabilistic modelling of learning and discrete mathematical problems in the theory of learning, data mining and artificial neural networks
  • Boolean function classes and their representations
Tugkan Batu

Dr Tugkan Batu - Assistant Professor

  • Algorithms and theory of computation; particularly randomized computation
  • Sublinear algorithms on massive data sets
  • Property testing
  • Computational statistics
Julia Bottcher

Dr Julia Böttcher - Assistant Professor

  • Extremal combinatorics
  • Random and quasi-random discrete structures
  • Ramsey theory
  • Algorithmical and structural graph theory
  • Graph colouring
Graham Brightwell

Prof Graham Brightwell - Professor

  • Combinatorics in general, especially finite partially ordered sets, probabilistic methods, and algorithmic aspects
  • Random graphs
  • Random structures
Jan van den Heuvel

Prof Jan van den Heuvel - Professor

  • Graph theory
  • Matroid theory
  • Applications and algorithmic aspects of graph theory
  • Mathematical aspects of frequency assignment problems
  • Mathematical aspects of networks
  • Discrete mathematics in general
Andy Lewis Pye

Dr Andy Lewis-Pye - Associate Professor

  • Algorithmic processes
  • Randomness
  • Computability
  • Algorithmic game theory
  • Agent based models
  • Networks
  • Discrete mathematics in general
Jozef Skokan

Dr Jozef Skokan - Associate Professor

  • Extremal set theory
  • Quasi-random structures
  • Probabilistic combinatorics
  • Discrete geometry
  • Graph theory
  • Combinatorial games
  • Topics in theoretical computer science
Konrad Swanepoel

Dr Konrad Swanepoel - Associate Professor

  • Combinatorial and discrete geometry
  • Axiomatic geometry
  • Finite geometries
  • Geometry of finite-dimensional normed spaces
  • Geometric shortest networks, such as Steiner Minimal Trees and the Fermat-Torricelli Problem
  • Extremal combinatorics