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  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 solutionsets 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”.





