Hi!  My name is Sean McCulloch, and I teach Computer Science at Ohio Wesleyan University.  This site is an educational resource for Computer Science teachers who want more information about the problems described in Garey and Johnson’s excellent Computers and Intractability: A Guide to the Theory of NP-Completeness.  Specifically, I look at the problems from the point of view of someone looking to assign them as homework or test questions to students just learning about NP-Completeness (for example, as a unit in an algorithms class)

You can find a larger description of the project here.  Please feel free to comment and share your opinions!

If you are interested in contacting me directly, please send me email.  I’ve added an extra space after the @ sign that you should remove.  Thanks!