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

 

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 group 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.  

Allen_PeterPeter Allen|: Extremal and random combinatorics; in particular Ramsey theory, extremal (hyper)graph theory, extremal theorems on (quasi)random structures, and algorithmic aspects thereof.

 

Martin AnthonyMartin Anthony|: 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 BatuTugkan Batu|: Algorithms and theory of computation; particularly, randomized computation, sublinear algorithms on massive data sets, property testing, computational statistics. 

 

Julia Bottcher|Julia Boettcher|: Extremal combinatorics, random and quasi-random discrete structures, Ramsey theory, algorithmical and structural graph theory, graph colouring.
  

Graham BrightwellGraham Brightwell|: Combinatorics in general, especially finite partially ordered sets, probabilistic methods, and algorithmic aspects.
  

 

Jan van den HeuvelJan van den Heuvel|: Discrete mathematics in general; graph theory; matroid theory; applications and algorithmic aspects of graph theory; mathematical aspects of frequency assignment problems; mathematical aspects of networks.    

Lewis,-Andy-thumbnail|Andy Lewis-Pye|: Algorithmic processes, randomness, computability, algorithmic game theory, agent based models, networks, discrete mathematics in general.

 

Jozef SkokanJozef Skokan|: Extremal set theory, quasi-random structures, probabilistic combinatorics, discrete geometry, graph theory, combinatorial games and topics in theoretical computer science. 

 

Konrad SwanepoelKonrad Swanepoel|: 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.

 

Share:Facebook|Twitter|LinkedIn|