Gary Hoppenworth

I am a Research Assistant Professor at TTIC. Previously, I was a PhD student at the University of Michigan, where I was very lucky to be advised by Greg Bodwin.

I am broadly interested in theoretical computer science. I am particularly drawn to algorithm and data structure problems with strong connections to graph theory and combinatorics.

Two lines of research I have focused on are:

Graph compression. Given a massive graph, how can we compress it while approximately preserving the features we care about?

Graph preconditioning. How can we restructure graphs—through augmentations or decompositions—to make them more amenable to fast algorithms?

My email address is
garytho[at]ttic[dot]edu

	Publications
	Reviving Thorup's Shortcut Conjecture Aaron Bernstein, Henry Fleischmann, Maximilian Probst Gutenberg, Bernard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller STOC 2026 [arXiv]
	Better Bounds for Semi-Streaming Single-Source Shortest Paths Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan SODA 2026 [arXiv]
	Near-Optimal Fault-Tolerant Strong Connectivity Preservers Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang FOCS 2025 [arXiv]
	Covering Approximate Shortest Paths with DAGs Sepehr Assadi, Gary Hoppenworth, Nicole Wein STOC 2025 [arXiv]
	New Separations and Reductions for Directed Hopsets and Preservers Gary Hoppenworth, Yinzhan Xu, Zixuan Xu SODA 2025 [arXiv]
	Additive Spanner Lower Bounds with Optimal Inner Graph Structure Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu ICALP 2024 [arXiv]
	The Discrepancy of Shortest Paths Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang ICALP 2024 [arXiv]
	Simple Linear-Size Additive Emulators Gary Hoppenworth SOSA 2024 [arXiv]
	Folklore Sampling is Optimal for Exact Hopsets Greg Bodwin and Gary Hoppenworth FOCS 2023, Invited to HALG 2024 [arXiv]
	Bridge Girth: A Unifying Notion in Network Design Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi FOCS 2023 [arXiv]
	New Additive Spanner Lower Bounds by an Unlayered Obstacle Product Greg Bodwin and Gary Hoppenworth FOCS 2022 [arXiv]
	Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan SOSA 2021 [arXiv]
	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 [arXiv]

Gary Hoppenworth

Publications