Greg Bodwin is a third year PhD candidate studying Computer Science Theory at Stanford University. He is fortunate to be advised by Virginia Vassilevska Williams. Before he came to Stanford, he graduated from Tufts University with a BS in Computer Science and Math. His research interests are in combinatorics, graph theory, and their applications to algorithm design. In particular, he has done some work on the graph spanner problem: how many edges can you remove from a graph while approximately maintaining its distance information? He also likes many other problems related to shortest path graph algorithms, including distance preservers, distance oracles, and distance reconstruction techniques. Bodwin is originally from the Bay Area and has already spent a few of his summers living in Berkeley. He is thrilled to be returning for his stay at the Simons Institute this fall.
- Fine-Grained Complexity and Algorithm Design, Fall 2015. Visiting Graduate Student.