Discrete Structures and Algorithms

The University of Melbourne

We are part of the Operations Research and Discrete Mathematics & Algebraic Combinatorics groups of the Department of Mathematics and Statistics at The University of Melbourne.

We do research in the broad area of discrete structures and algorithms, with a focus on algebraic graph theory, graph structures, network optimisation, scheduling, survivable networks, Steiner trees, and applications of OR and integer programming.

We organise the following activities:

You are welcome to subscribe to the announcements for these events here.

If you would like to give a presentation in our DSA seminar, you are welcome to contact Sanming Zhou.


Ph.D. Students

Completed Students

Completed Vacation Scholars

Past Research Fellows