Graphs, networks, and combinatorics

Graphs, networks, and combinatorics form the mathematical backbone of discrete structures, enabling the modeling and analysis of complex relationships and interactions in computational systems.

Our research focuses on algorithms, combinatorial structures, and complexity analysis in networks and distributed systems. We employ mathematical modelling, formal design and simulations across several core areas: central network protocols; network discovery, dynamic topology, and fault tolerance; natural processes and stabilization; and temporal graph theory. These studies contribute to a deeper understanding of both theoretical principles and practical mechanisms that underpin modern computing systems.

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.