ARC-Funded Research Projects
Published:
Competitive grant-funded research in algorithm analysis, benchmarking, and optimisation.
Posts by Collection
portfolio
Industry Collaborations
Published:
Applied research with industry partners including AGL, Boeing Australia, and Future Fibre Technologies.
MATILDA – Melbourne Algorithm Test Instance Library with Data Analytics
Published:
Cloud-based platform for Instance Space Analysis, supporting rigorous algorithm benchmarking across multiple domains.
talks
teaching
Algorithms and Complexity
Postgraduate compulsory subject, School of Computing and Information Systems, The University of Melbourne, 2018
COMP90038 is a mandatory postgraduate subject covering algorithm design, analysis, and complexity theory. Topics include sorting and searching, graph algorithms, dynamic programming, greedy algorithms, and NP-completeness.
Computational Modelling and Simulation
Postgraduate elective subject, School of Computing and Information Systems, The University of Melbourne, 2022
COMP90083 is a postgraduate elective subject covering topics including Agent-Based Modelling, System Dynamics, Network Analysis, Optimisation, and Simulation techniques. The subject applies these methods to real-world complex systems across multiple domains. It was initially developed by Prof. Nic Geard in 2020.