2022 / Vienna, Austria

• C. S. Bhargav, Sagnik Dutta, and Nitin Saxena: "Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits"
• Gaëtan Douéneau-Tabot and Olivier Carton: "Continuous rational functions are deterministic regular"

2021 / Tallinn, Estonia

• Yoan Géran, Bastien Laboureix, Corto Mascle and Valentin D. Richard: "Keyboards as a New Model of Computation"

2020 / Prague, Czech Republic

2019 / Aachen, Germany

• Eva Fluck: "Tangles and Single Linkage Hierarchical Clustering"

2018 / Liverpool, UK

• Titus Dose: "Balance Problems for Integer Circuits"

2017 / Aalborg, Denmark

• Neil Lutz: "Fractal Intersections and Products via Algorithmic Dimension"

2016 / Krakow, Poland

• Andreas Tollkötter: "Transformation between regular expressions and ω-automata"

2015 / Milano, Italy

• Meirav Zehavi: "Maximum Minimal Vertex Cover Parameterized by Vertex Cover"

2014 / Budapest, Hungary

• Thomas Zeume: "The Dynamic Descriptive Complexity of k-Clique"

2013 / Klosterneuburg, Austria

• Sébastien Tavenas: "Improved bounds for reduction to depth 4 and depth 3"

2012 / Bratislava, Slovakia

• Tatiana Starikovskaya: "Computing Lempel-Ziv Factorization Onlin"

2011 / Warsaw, Poland

• Remi Bonnet : "The Reachability Problem for Vector Addition Systems with one Zero-Test"