2023 / Bordeaux, France

• Manon Blanc and Olivier Bournez: "A characterization of functions computable in polynomial time and space over the reals with discrete ordinary differential equations. Simulation of Turing machines with analytic discrete ordinary differential equations."

2022 / Vienna, Austria

• Petr Gregor, Arturo Merino, and Torsten Mütze: "The Hamilton compression of highly symmetric graphs"

2021 / Tallinn, Estonia

• Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen and Martin Zimmermann: "A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct"

2020 / Prague, Czech Republic

• Susanne Albers, Arindam Khan and Leon Ladewig: "Best Fit Bin Packing with Random Order Revisited"
• Mikołaj Bojańczyk and Janusz Schmude: "Some remarks on deciding equivalence for graph-to-graph transducers"

2019 / Aachen, Germany

• Paweł Parys: "Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time"

2018 / Liverpool, UK

• Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran and Jeffrey Shallit: "Lagrange's Theorem for Binary Squares"

2017 / Aalborg, Denmark

• Henning Urbat, Jiri Adamek, Liang-Ting Chen and Stefan Milius: "Eilenberg Theorems for Free"

2016 / Krakow, Poland

• Bart M. P. Jansen and Astrid Pieterse: "Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials"

2015 / Milano, Italy

• Paweł Gawrychowski and Damian Straszak: "Strong Inapproximability of the Shortest Reset Word"

2014 / Budapest, Hungary

• Eric Allender and Bireswar Das: "Zero Knowledge and Circuit Minimization"

2013 / Klosterneuburg, Austria

• Sébastien Tavenas: "Improved bounds for reduction to depth 4 and depth 3"
• Sarel Cohen, Amos Fiat, Moshik Hershcovitch and Haim Kaplan: "Minimal Indices for Successor Search"

2012 / Bratislava, Slovakia

• Igor Tunev and Arseny Shur: "On Two Stronger Versions of Dejean´s Conjectur"

2011 / Warsaw, Poland