I'm a fourth year PhD candidate studying Theoretical Computer Science. I recently moved to MIT to complete my PhD there. I am fortunate to be advised by Virginia Vassilevska Williams.
My main research interests are in combinatorics, extremal graph theory, and their applications to algorithm design and theoretical computer science. I particularly like problems related to shortest paths in graphs.
I have some recent results about Additive Spanner lower bounds! The 4/3 Additive Spanner Exponent is Tight (via arxiv).
I have a Master's in Computer Science from Stanford, and a B.S. in Computer Science and Math from Tufts University.
You can email me at gbodwin@(three-letter school acronym).edu .