Gary Hoppenworth
I am a second-year PhD student at the University of Michigan. I am fortunate to be advised by Greg Bodwin. I am interested in combinatorics and graph algorithms (among other things).My email address is
garytho[at]umich[dot]edu
|
Gary HoppenworthI am a second-year PhD student at the University of Michigan. I am fortunate to be advised by Greg Bodwin. I am interested in combinatorics and graph algorithms (among other things).My email address is garytho[at]umich[dot]edu |
Publications |
||
|
Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier Greg Bodwin and Gary Hoppenworth FOCS 2023 [link] |
||
|
Bridge Girth: A Unifying Notion in Network Design Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi FOCS 2023 [link] |
||
|
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product Greg Bodwin and Gary Hoppenworth FOCS 2022 [link] |
||
|
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan SOSA 2021 [link] |
||
|
The Fine-Grained Complexity of Median and Center String Problems under Edit Distance Jason W. Bentley, Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan ESA 2020 [link] |
||