Worked solutions to all 236 end-of-chapter exercises in Algorithm Design by Jon Kleinberg and Éva Tardos — stable matching, asymptotic analysis, graph search, greedy algorithms, divide and conquer, dynamic programming, network flow, NP-completeness, PSPACE, fixed-parameter and approximation algorithms, local search, and randomized algorithms, each with an algorithm, a correctness proof and a running-time bound.