2016: Andreas Björklund for his paper Determinant Sums for Undirected Hamiltonicity, showing that methods based on
algebraic graph theory lead to a significantly improved algorithm for
finding Hamiltonian cycles[7]
2017:
Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch, for developing the "measure and conquer" method for the analysis of backtracking algorithms.[8]
2018: Stefan Kratsch and Magnus Wahlström for their work using
matroid theory to develop polynomial-size kernels for
odd cycle transversal and related problems.[9][10]
2019:
Noga Alon, Raphael Yuster, and
Uri Zwick, for inventing the
Color-coding technique, a vastly important ingredient in the toolbox of parameterized algorithm design.[11]
2020: Daniel Marx, Jianer Chen, Yang Liu, Songjian Lu, Barry O’Sullivan, Igor Razgon, for inventing the concepts of important separators and cuts which have become elegant and efficient tools used to establish the fixed parameter tractability of graph problems.[12]
2023: Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, and Jakub Onufry Wojtaszczyk for their paper Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.[14]