Workshop: Parametrized complexity and discrete optimization

Dates: December 6 - 10, 2021
Venue: This workshop is currently scheduled to take place online

In case there will be relaxations with regard to the hygienic restrictions that are currently necessary due to COVID-19, the workshop may take place on-site. This will be decided  approx. 3 months prior to the event and this website will be updated correspondingly.

Organizers: Parinya Chalermsook (Aalto), Friedrich Eisenbrand (Lausanne), Fedor Fomin (Bergen), Jesper Nederlof (Utrech)


This Workshop focuses on the synergy between parametrized complexity and discrete optimization, two active and vibrant areas of mathematics and computer science. On the one hand, a fine-grained/parametrized view of discrete optimization has recently led to groundbreaking results (e.g. the role of fine-grained complexity assumptions, such as ETH and SETH, in explaining the lack of progress on long-standing open problems in discrete optimization) as well as new directions of research (e.g. parametrized approximation algorithms). On the other hand, techniques from Discrete Optimization, such as integer programming and the algorithmic geometry of numbers, as well as convex programming, are becoming indispensable tools in modern parameterized complexity that leads to exciting new results.


The goal of this workshop is to further enhance this synergy by bringing together the leading experts in these two areas.