In Spring 2009, all talks in the Department Colloquium were given by my students. Below are their presentations.

---

• The Value of Mate-pairs for Repeat Resolution   presented by Josh Wetzel
• Capacitated Vertex Cover   presented by James Davis
• Partial Vertex Cover   presented by Josh Wetzel
• Vertex Cover: Linear Programming and Approximation Algorithms   presented by Josh Wetzel
• A Simple Min-Cut Algorithm   presented by Joe Vessella
• The Small World Phenomenon   presented by Brad Greening
• Proofs that Really Count: The Art of Combinatorial Proof   presented by Brad Greening