Latest Post

SACT Seminar: Fast Algorithms for Diameter-Optimally Augmenting Trees

Time: 12:00 noon Tuesday, 16th August 2016. Location: SIT 459 Speaker: Joachim Gudmundsson, University of Sydney Title: Fast Algorithms for Diameter-Optimally Augmenting Trees Abstract: We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present … Continue reading


  • The ARC has published the outcomes of the latest Excellence in Research for Australia (ERA) ranking. The University of Sydney was ranked "well above world standard" in Computation Theory and Mathematics (0802), the highest possible ranking!

About the group

The Sydney Algorithms and Computing Theory group nucleates researchers from the University of Sydney interested in foundational aspects of computer science. Our research interests include algorithmic game theory, combinatorial optimization, computational complexity, computational geometry, graph drawing, and machine learning. The unifying theme running through our research is the inquiry into the nature of efficient computation.

Here you will find information about our people, our seminar, and the courses we offer.

Event calendar

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 52 other followers


Get every new post delivered to your Inbox.

Join 52 other followers