Department of Computer Science

Algorithms and Theory of Computation


Combinatorial optimisation is related to operations research, algorithm theory and computational complexity theory. Combinatorial optimisation algorithms solve instances of problems that are believed to be hard in general, by exploring the usually-large solution space of these instances. Combinatorial optimisation algorithms achieve this by reducing the effective size of the space, and by exploring the space efficiently.

Computational techniques for discovering/processing several types of combinatorial objects are also of interest, such as network design (via algebraic and ad-hoc graph constructions) and utilisation of fixed-parameter techniques such as bounded pathwidth/ treewidth for coping with hard "real-world" problems.

Members (academic staff or PhD students):

Academic staff:
Cristian Calude, Michael J. Dinneen, Bakh Khoussainov, Simone Linz, Andre Nies, Mark Wilson

PhD students:
Richard Hua, Nan Huang, Jonathan Klawitter, Nguyet Tran