David Johnson used to write the 'NP-Completeness Column' for the Journal of Algorithms, and put it on an extended hiatus in 1992. He's restarting the column at its new home in the ACM Transactions on Algorithms, and in the tradition of must-read-columns everywhere, has brought out a special edition ! super-enhanced ! electronic ! director's cut !! one-time only !!! compilation of all his previous columns. Read them all and find out what you're missing !!!!
p.s Writer's commentary, subtitles in Swahili and extra deleted text not included.
p.p.s Jokes aside, these columns are really worth a read. They are written so as to be accessible to the practising theorist without compromising on level of detail and rigor.