>
home

Latest Post

2 PhD Positions in Computational Geometry at the University of Sydney

Posted by ⋅

Two PhD scholarships are available at the Sydney Algorithms and Computing Theory group (SACT), School of Computer Science, University of Sydney, Australia. The research area is computational geometry, with a focus on geometric graphs, spanners, graph augmentation, and routing algorithms, under the supervision of Joachim Gudmundsson and André van Renssen.  The PhD scholarships include: Applicants should … Continue reading →

Leave a comment Announcements

Updates

  • 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.

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

Join 106 other subscribers