2014 | 2015 | 2016 | 2018 |
---|---|---|---|

D.P. Williamson and D.B. Shmoys, The design of approximation algorithms, Cambridge University Press, 2011 |
Fun with Algorithms, conference series, Lecture Notes in Computer Science. | Satisfiability, Knuth TAoCP Vol 4, Section 7.2.2.2 & SAT conference series. | Elwyn R. Berlekamp, John H. Conway and Richard K. Guy, Winning Ways for your Mathematical Plays, Academic Press, two volumes, 1982. Second edition: AK Peters, four volumes, 2001-2004. |

2010 | 2011 | 2012 | 2013 |

Donald E. Knuth, The Art of Computer Programming, Volume 4, Combinatorial Algorithms, 2011 | R.A. Hearn and E.D. Demaine, Games, Puzzles, & Computation, Peters, 2009 |
T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms (3rd ed.), 2009, MIT Press and McGraw-Hill |
Amy N. Langville & Carl D. Meyer, Who's #1? The Science of Rating and Ranking, Princeton University Press, 2012 |

And even older: 2008: DNA String Algorithms. And 2002: Advanced BioComputing.