Best ICALP Paper
The prize of "Best ICALP Paper" is awarded at the ICALP conferences.
A brief history of the prize follows below.




 Track A  TsunMing 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 2VertexConnectivity"
 Track B  Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry SinclairBanks, and Karol Węgrzycki: "Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality"









 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: "Twinwidth and types"









 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"









 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'"









 Track A  Bingkai Lin: "A Simple Gapproducing Reduction for the Parameterized Set Cover Problem''
 Track B  Christof Loding and Anton Pirogov: "Determinization of Buchi Automata: Unifying the Approaches of Safra and MullerSchupp"
 Track C  Keren CensorHillel and Mikael Rabie: "Distributed Reconfiguration of Maximal Independent Sets''









 Track A  Heng Guo and Mark Jerrum: "A polynomialtime approximation algorithm for allterminal network reliability"
 Track B  Dirk Nowotka and Aleksi Saarela: "An optimal bound on the solution sets of onevariable 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"









 Track A  Andreas Björklund, Petteri Kaski and Ioannis Koutis: “Directed Hamiltonicity and OutBranchings via Generalized Laplacians”
 Track B  Michael Benedikt, Pierre Bourhis and Michael Vanden Boom: “Characterizing Definability in Decidable Fixpoint Logics”
 Track C  Eyjólfur Ingi Ásgeirsson, Magnus M. Halldorsson and Tigran Tonoyan: “Universal Framework for Wireless Scheduling Problems”





