Latest Post

SACT Seminar: Hung-Lung Wang

Time: Thursday 31 August, 10–11am. Location: “Common Area” of level 4W. Speaker: Hung-Lung Wang, National Taipei University of Business. Title: Convexity on AT-free graphs Abstract: We deal with the anti-exchange property with respect to a kind of graph convexity. We show that the property holds if and only if the graph under consideration isAT-free. An application to generating theATfree … Continue reading


  • Together with UNSW's algorithms group the SACT group will organise a pre-ISAAC algorithms workshop.  The focus of the workshop will be Fixed Parameter Computational Geometry. (more…)

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 68 other followers