December 18-19, 2025
Sydney, Australia
https://sites.google.com/view/tao25workshop/home
Registration deadline: December 1, 2025
This is a free 2-day workshop, right after FOCS 2025, to discuss recent advances in approximation and online algorithms for network design and related areas. This is the 10th iteration of the Flexible Network Design workshop series. The workshop will have a mix of talks—including plenary talks by MohammadTaghi Hajiaghayi on beating 2-approximation for Steiner forest, and Jarek Byrka on recent advances on bidirected cut relaxations—as well as a Wiki Edit-a-thon and an Open Problem Session.
Students, faculty, and researchers of all seniority levels are welcome.
CS Theory Events 