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]
nerode, prize, this, article, relies, excessively, references, primary, sources, please, improve, this, article, adding, secondary, tertiary, sources, find, sources, news, newspapers, books, scholar, jstor, 2013, learn, when, remove, this, message, eatcs, ipec. This article relies excessively on references to primary sources Please improve this article by adding secondary or tertiary sources Find sources Nerode Prize news newspapers books scholar JSTOR May 2013 Learn how and when to remove this message The EATCS IPEC Nerode Prize is a theoretical computer science prize 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 editThe 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 5 2015 Erik Demaine Fedor V 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 6 2016 Andreas Bjorklund 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 Wahlstrom 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 2021 C S Calude S Jain B Khoussainov W Li F Stephan for their quasipolynomial time algorithm for deciding parity games 13 2022 B Courcelle for Courcelle s theorem on the fixed parameter tractability of graph properties in monadic second order logic 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 See also editList of computer science awardsReferences edit IPEC Nerode Prize European Association for Theoretical Computer Science retrieved 2015 09 03 EATCS IPEC Nerode Prize Parameterized Complexity retrieved 2015 09 03 EATCS IPEC Nerode Prize 2013 Laudatio European Association for Theoretical Computer Science retrieved 2015 09 03 Nelson Patrick October 6 2014 Academic wins international maths prize Retrieved November 1 2022 EATCS IPEC Nerode Prize 2014 Laudatio European Association for Theoretical Computer Science retrieved 2015 09 03 Hajiaghayi Wins 2015 Nerode Prize University of Maryland Institute for Advanced Computer Studies May 8 2015 retrieved 2015 09 03 EATCS IPEC Nerode Prize 2016 European Association for Theoretical Computer Science August 29 2016 retrieved 2016 08 29 ALGO 2017 ALGO 2017 September 3 2017 retrieved 2017 09 03 Magnus Wahlstrom was awarded the 2018 Nerode Prize May 13 2018 Archived from the original on January 25 2022 Retrieved November 1 2022 ALGO 2018 keynote speakers Helsinki Institute for Information Technology retrieved 2018 08 24 EATCS IPEC Nerode Prize 2019 European Association for Theoretical Computer Science September 3 2019 retrieved 2020 01 01 Darmody Jenny 2020 12 16 Ireland s Prof Barry O Sullivan wins global computer science award Silicon Republic Retrieved 2022 11 01 NUS Computing professors Sanjay Jain and Frank Stephan win EATCS IPEC Nerode Prize NUS Computing Retrieved 2022 11 01 EATCS IPEC Nerode Prize 2023 European Association for Theoretical Computer Science retrieved 2024 01 18 P NP This theoretical computer science related article is a stub You can help Wikipedia by expanding it vte nbsp This science awards article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Nerode Prize amp oldid 1223179005, wikipedia, wiki, book, books, library,
