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