Graphs, networks, and combinatorics
Graphs, networks, and combinatorics form the mathematical backbone of discrete structures, enabling the modelling and analysis of complex relationships and interactions in computational systems.
Our research focuses on algorithms, combinatorial structures, and complexity analysis in graphs, networks, and distributed systems. We employ mathematical modelling, formal design, and simulations across these areas, contributing to a deeper understanding of the theoretical principles and practical mechanisms that underpin modern computing systems.
Research
Our core research topics include
- Graph Theory and Combinatorial Structures: We study the mathematical foundations of graphs and combinatorial objects, which provide rigorous models for representing relationships and interactions. Our work includes structural graph theory, hypergraphs, random graphs, temporal and multilayer graphs, and combinatorial methods that underpin modern algorithmic analysis.
- Algorithms and Complexity in Networks: We design and analyze algorithms for distributed and dynamic networks, with attention to time and space complexity as well as fault tolerance. Key areas include network discovery, central protocols, stabilisation processes in evolving systems, self-organising and reconfigurable systems, natural and bio-inspired processes.
- Distributed Systems: Building on these theoretical foundations, we apply combinatorial and algorithmic techniques to distributed and networked computing. Through mathematical modeling, formal design, and simulation, we study mechanisms that ensure robustness, adaptability, and scalability in modern systems.
People
- Mr Sebastian Coope
- Professor Leszek Gasieniec
- Dr Vladimir Gusev
- Professor Vitaliy Kurlin
- Dr Othon Michail
- Dr Anish Mukherjee
- Dr Lutz Oettershagen
- Professor Igor Potapov
- Professor Paul Spirakis
- Dr Joachim Spoerhase
- Dr Karteek Sreenivasaiah
- Dr John Sylvester
- Dr Konstantinos Tsakalidis
- Dr Sebastian Wild
- Professor Prudence Wong
- Dr Viktor Zamaraev
Opportunities
We welcome opportunities to engage with students, researchers, and industry partner:
- PhD opportunities: please contact us if you are interested in pursuing a PhD in graphs, networks, and combinatorics
- Consultancy and research collaborations: we welcome partnerships, consultancy, and knowledge exchange projects with academic, industry, and government partners.
Contact us
Please discuss with relevant academic staff if you are interested in their research.