Nerode Prize

The EATCS--IPEC Nerode Prize is a theoretical computer science prize given awarded for outstanding research in the area of multivariate algorithmics. It is awarded by the European Association for Theoretical Computer Science and the International Symposium on Parameterized and Exact Computation.^[1] The prize was offered for the first time in 2013.^[2]

Winners

The prize winners so far have been:

• 2013: Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi, and Francis Zane, for their research formulating the exponential time hypothesis and using it to determine the exact parameterized complexity of several important variants of the Boolean satisfiability problem.^[3]
• 2014: Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin, Lance Fortnow, and Rahul Santhanam, for their work on kernelization, proving that several problems with fixed-parameter tractable algorithms do not have polynomial-size kernels unless the polynomial hierarchy collapses.^[4]
• 2015: Erik Demaine, Fedor Fomin, Mohammad Hajiaghayi, and Dimitrios Thilikos, for their research on bidimensionality, defining a broad framework for the design of fixed-parameter-tractable algorithms for domination and covering problems on graphs.^[5]

References

1. IPEC Nerode Prize, European Association for Theoretical Computer Science, retrieved 2015-09-03.
2. "EATCS-IPEC Nerode Prize", Parameterized Complexity, retrieved 2015-09-03.
3. EATCS-IPEC Nerode Prize 2013 - Laudatio, European Association for Theoretical Computer Science, retrieved 2015-09-03.
4. EATCS-IPEC Nerode Prize 2014 - Laudatio, European Association for Theoretical Computer Science, retrieved 2015-09-03.
5. Hajiaghayi Wins 2015 Nerode Prize, University of Maryland Institute for Advanced Computer Studies, May 8, 2015, retrieved 2015-09-03.