2023 / Paderborn

• Track A - Tsun-Ming Cheung, Hamed Hatami, Pooya Hatami and Kaave Hosseini: "Online Learning and Disambiguations of Partial Concept Classes"
• Track A - Miguel Bosch Calvo, Fabrizio Grandoni and Afrouz Jabal Ameli: "A 4/3 Approximation for 2-Vertex-Connectivity"
• Track B - Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, and Karol Węgrzycki: "Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality"

2022 / Paris

• Track A - Ilan Newman and Nithin Varma: "Strongly Sublinear Algorithms for Testing Pattern Freeness"

• Track B - Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski and Szymon Toruńczyk: "Twin-width and types"

2021 / Glasgow

• Track A - Sayan Bhattacharya and Peter Kiss: "Deterministic Rounding of Dynamic Fractional Matchings"

• Track B - Antoine Amarilli, Louis Jachiet and Charles Paperman: "Dynamic Membership for Regular Languages"

2020 / Saarbrücken

• Track A - Pawel Gawrychowski, Shay Mozes and Oren Weimann: "Minimum cut in O(m log^2 n) time"

• Track B - David Barozzini, Lorenzo Clemente, Thomas Colcombet and Pawel Parys: "Cost automata, safe schemes, and downward closures'"

2019 / Patras

• Track A - Bingkai Lin: "A Simple Gap-producing Reduction for the Parameterized Set Cover Problem''

• Track B - Christof Loding and Anton Pirogov: "Determinization of Buchi Automata: Unifying the Approaches of Safra and Muller-Schupp"

• Track C - Keren Censor-Hillel and Mikael Rabie: "Distributed Reconfiguration of Maximal Independent Sets''

2018 / Prague

• Track A - Heng Guo and Mark Jerrum: "A polynomial-time approximation algorithm for all-terminal network reliability"

• Track B - Dirk Nowotka and Aleksi Saarela: "An optimal bound on the solution sets of one-variable word equations and its consequences”

• Track C - Dariusz Kowalski and Miguel A. Mosteiro: "Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations"

2017 / Warsaw

• Track A - Andreas Björklund, Petteri Kaski and Ioannis Koutis: “Directed Hamiltonicity and Out-Branchings via Generalized Laplacians”

• Track B - Michael Benedikt, Pierre Bourhis and Michael Vanden Boom: “Characterizing Defin-ability in Decidable Fixpoint Logics”

• Track C - Eyjólfur Ingi Ásgeirsson, Magnus M. Halldorsson and Tigran Tonoyan: “Universal Framework for Wireless Scheduling Problems”

2016 / Rome

• Track A - Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas and David Richerby: "Amplifiers for the Moran Process"

• Track A - Neeraj Kayal, Chandan Saha and Sébastien Tavenas: "An almost Cubic Lower Bound for Depth Three Arithmetic Circuits"

• Track B - Olivier Bournez, Daniel Graça and Amaury Pouly: "Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length"

2015 / Kyoto

• Track A - Aaron Bernstein and Clifford Stein: "Fully Dynamic Matching in Bipartite Graphs"

• Track B - Jarkko Kari and Michal Szabados: "An Algebraic Geometric Approach to Nivat's Conjecture"

• Track C - Yiannis Giannakopoulos and Elias Koutsoupias: "Selling two goods optimally"

2014 / Copenhagen

• Track A - Andreas Björklund and Thore Husfeldt: "Shortest Two Disjoint Paths in Polynomial Time"

• Track B - Joel Ouaknine and James Worrell: "Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences"

• Track C - Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden and Berthold Voecking: "Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods"

2013 / Latvia

• Track A - Mark Bun and Justin Thaler: "Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities"

• Track B - John Fearnley and Marcin Jurdziński: "Reachability in Two-Clock Timed Automata is PSPACE-complete"

• Track C - Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak and Przemysław Uznański:  "Fast Collaborative Graph Exploration"

2012 / Warwick

• Track A - Leslie Ann Goldberg and Mark Jerrum: "The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)"

• Track B - Volker Diekert, Manfred Kufleitner, Klaus Reinhardt and Tobias Walter: "Regular Languages are Church-Rosser Congruential"

• Track C - Piotr Krysta and Berthold Vöcking : "Online Mechanism Design (Randomized Rounding on the Fly)"

2011 / Zürich

• Track A - Malte Beecken, Johannes Mittmann, Nitin Saxena: "Algebraic Independence and Blackbox Identity Testing"

• Track B - Olivier Carton, Thomas Colcombet, Gabriele Puppis: "Regular Languages of Words Over Countable Linear Orderings"

• Track C - Martin Hoefer : "Local Matching Dynamics in Social Networks"

Photos from ICALP 2011 by Manfred Kudlek

2010 / Bordeaux

• Track A - Leslie Ann Goldberg, Mark Jerrum: "Approximating the Partition Function of the Ferromagnetic Potts Model"

• Track B - Yijia Chen, Jörg Flum: "On optimal proof systems and logics for PTIME"

• Track C - Georg B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks : "Placing Regenerators in Optical Networks to Safity Multiple Sets of Requests"

Photos from ICALP 2010 by Manfred Kudlek

2009 / Rhodes

• Track A - Amin Coja-Oghlan : "A Better algorithm for random k-SAT"

• Track B - Lars Kuhtz, Bernd Finkbeiner : "LTL Path Checking is Efficiently Parallelizable"

• Track C - Alexander Fanghaenel, Thomas Kesselheim, Berthold Voecking : "Improved Algorithms for Latency Minimization in Wireless Network"

Photos from ICALP 2009 by Manfred Kudlek

2008 / Reykjavik

• Track A - David Buchfuhrer, Christopher Umans : "The complexity of Boolean formula minimization"

• Track B - Mai Gehrke, Serge Grigorieff, Jean-Eric Pin : "Duality and equational theory of regular languages"

• Track C - Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang: "Making Classical honest verifier zero-knowledge protocols secure against quantum attacks"

Photos from ICALP 2008 by Manfred Kudlek

2007 / Wroclaw

• Track A - Jin-Yi Cai, Pinyan Lu : "Holographic algorithms. The Power of Dimensionality Resolved"

• Track B - Bernard Boigelot, Julien Brusten : "A Generalization of Cobham's Theorem to Automata over Real Numbers"

• Track C - Tal Moran, Moni Naor, Gil Segev : "Deterministic History Independent Strategies for Storing Information on Write Once Memories"

2006 / Venice

• Track A - Leslie Ann Goldberg, Mike Paterson : "On counting homomorphisms to directed acyclic graphs"

• Track B - Filip Murlak : "The Wadge Hierarchy of Deterministic Tree Languages"

• Track C - Iftach Haitner, Danny Harnik, Omer Reingold: "Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions"

2005 / Lisboa

• Track B - Martin Grohe, Christoph Koch, Nicole Schweikardt : "Tight Lower Bounds for Query Processing on Streaming and External Memory Data"

• Track C - Marius Zimand : "Simple Extractors Via Constructions of Cryptographic Pseudo-random Generators"

2004 / Turku

• Track A - Christoph Dürr, Mark Heiligman, Peter Hoyer, Mehdi Mhalla : "Quantum query complexity of some graph problems"

• Track B - Mikolaj Bojanczyk, Thomas Colcombet : "Tree-Walking Automata Cannot Be Determinized"

2003 / Eindhoven

• Track A - Anna Gal, Peter Bro Miltersen : "The cell probe complexity of succint data structures"

• Track B - Marielle Stoelinga, Frits Vaandrager : "A testing scenario for probabilistic automata"

2002 / Málaga

• Lars Engebretsen, Jonas Holmerin, Alexander Russell: "Inapproximability Results for Equations over Finite Groups"

2001 / Creta

• Track A - William Hesse : "Division is in Uniform TC0"

• Track B - Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani : "Effective Lossy Queue Languages"

2000 / Geneva

• Track A - Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning : "Deterministic algorithms for k-SAT based on covering codes and local search"

• Track B - Dan R. Ghica, Guy McCusker : "Reasoning about idealized Algol using regular languages"

• Track C - Seth Pettie, Vijaya Ramachandran : "An optimal minimum spanning tree algorithm"