The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance. - Gary Hoppenworth; Jason W. Bentley; Daniel Gibney; Sharma V. Thankachan (ESA, 2020)

More Time-Space Tradeoffs for Finding a Shortest Unique Substring. - Hideo Bannai; Travis Gagie; Gary Hoppenworth; Simon J. Puglisi; Luís M. S. Russo (Algorithms, 2020)

Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics. - Jason W. Bentley; Daniel Gibney; Gary Hoppenworth; Sumit Kumar Jha 001 (CoRR, 2020)

Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism. - Daniel Gibney; Gary Hoppenworth; Sharma V. Thankachan (SOSA, 2021)

New Additive Spanner Lower Bounds by an Unlayered Obstacle Product. - Greg Bodwin; Gary Hoppenworth (FOCS, 2022)

Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier. - Greg Bodwin; Gary Hoppenworth (FOCS, 2023)

Bridge Girth: A Unifying Notion in Network Design. - Greg Bodwin; Gary Hoppenworth; Ohad Trabelsi (FOCS, 2023)

The Discrepancy of Shortest Paths. - Greg Bodwin; Chengyuan Deng; Jie Gao 001; Gary Hoppenworth; Jalaj Upadhyay; Chen Wang 027 (ICALP, 2024)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure. - Greg Bodwin; Gary Hoppenworth; Virginia Vassilevska Williams; Nicole Wein; Zixuan Xu (ICALP, 2024)

Simple Linear-Size Additive Emulators. - Gary Hoppenworth (SOSA, 2024)

New Separations and Reductions for Directed Preservers and Hopsets. - Gary Hoppenworth; Yinzhan Xu; Zixuan Xu (CoRR, 2024)

New Separations and Reductions for Directed Hopsets and Preservers. - Gary Hoppenworth; Yinzhan Xu; Zixuan Xu (SODA, 2025)

Covering Approximate Shortest Paths with DAGs. - Sepehr Assadi; Gary Hoppenworth; Nicole Wein (STOC, 2025)

Multiplicative Spanners in Minor-Free Graphs. - Greg Bodwin; Gary Hoppenworth; Zihan Tan (CoRR, 2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths. - Sepehr Assadi; Gary Hoppenworth; Janani Sundaresan (CoRR, 2025)