BARC talk by Joachim Gudmundsson

Tuesday, September 9, 2025, Joachim Gudmundsson, Professor at the University of Sydney, Australia, will give a talk on "Efficient algorithms for realistic geometric graphs".

Abstract:
Geometric graphs play a central role in computational geometry, graph algorithms, and applications ranging from network design to geometric data analysis. While worst-case models often fail to capture the structure observed in practice, several realistic models have been proposed in recent years to bridge this gap. In this work, we concentrate on two prominent models: c-packed graphs and λ-low-density graphs. For both models, we survey and present recent algorithmic advances for constructing fundamental tools, including separators, well-separated pair decompositions, single-source shortest path algorithms, and distance oracles.

Bio:
Joachim Gudmundsson is a Professor of Algorithms at the University of Sydney, where he leads the Sydney Algorithms and Computing Theory (SACT) group and has served as Head of the School of Computer Science 2020-2025. He received his PhD in 2000 from Lund University, followed by research fellowships at Utrecht University and TU Eindhoven. From 2005 to 2011, he was a principal researcher at National ICT Australia, before returning to academia as an ARC Future Fellow at the University of Sydney. His research in computational geometry and algorithms spans more than two decades. His work has been supported by the Swedish Foundation for International Cooperation in Research, Australian Research Council, the Netherlands Organisation for Scientific Research, Google, and the Australian Defence Science and Technology Group. He serves on the editorial boards of GeoInformatica and ACM Transactions on Spatial Algorithms and Systems and is a co-founder of the Journal of Computational Geometry.

Host:
Rasmus Pagh