Below are the presentations given by my students in the Department Colloquium as well as at other places.

---

• Multiway Cut   presented by Sean Lowen
• An Improved LP-based Approximation for Steiner Tree   presented by Yuping Tang
• PTAS for Euclidean TSP   presented by Vijay Kothari
• Iterated Rounding and Relaxation   presented by James Davis
• 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