Very Sparse Additive Spanners and Emulators. - Gregory Bodwin; Virginia Vassilevska Williams (ITCS, 2015)

Fully Dynamic Spanners with Worst-Case Update Time. - Greg Bodwin; Sebastian Krinninger (ESA, 2016)

Error Amplification for Pairwise Spanner Lower Bounds. - Amir Abboud; Greg Bodwin (SODA, 2016)

Graph Reconstruction with a Betweenness Oracle. - Mikkel Abrahamsen; Greg Bodwin; Eva Rotenberg; Morten Stöckel (STACS, 2016)

Testing Core Membership in Public Goods Economies. - Greg Bodwin (ICALP, 2017)

Preserving Distances in Very Faulty Graphs. - Greg Bodwin; Fabrizio Grandoni 001; Merav Parter; Virginia Vassilevska Williams (ICALP, 2017)

Linear Size Distance Preservers. - Greg Bodwin (SODA, 2017)

The 4/3 Additive Spanner Exponent Is Tight. - Amir Abboud; Greg Bodwin (J. ACM, 2017)

Optimal Vertex Fault Tolerant Spanners (for fixed stretch). - Greg Bodwin; Michael Dinitz; Merav Parter; Virginia Vassilevska Williams (SODA, 2018)

A Hierarchy of Lower Bounds for Sublinear Additive Spanners. - Amir Abboud; Greg Bodwin; Seth Pettie (SIAM J. Comput., 2018)

Sketching distances in graphs. - Gregory Michael Bodwin (2018)

A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners. - Greg Bodwin; Shyamal Patel (PODC, 2019)

On the Structure of Unique Shortest Paths in Graphs. - Greg Bodwin (SODA, 2019)

Matrix Decompositions and Sparse Graph Regularity. - Greg Bodwin; Santosh S. Vempala (CoRR, 2019)

Strategy-Stealing is Non-Constructive. - Greg Bodwin; Ofer Grossman (Electron. Colloquium Comput. Complex., 2019)

New Fault Tolerant Subset Preservers. - Greg Bodwin; Keerti Choudhary; Merav Parter; Noa Shahar (ICALP, 2020)

Weighted Additive Spanners. - Abu Reyan Ahmed; Greg Bodwin; Faryad Darabi Sahneh; Stephen G. Kobourov; Richard Spence (WG, 2020)

Some General Structure for Extremal Sparsification Problems. - Greg Bodwin (CoRR, 2020)

Graph spanners: A tutorial review. - Abu Reyan Ahmed; Greg Bodwin; Faryad Darabi Sahneh; Keaton Hamm; Mohammad Javad Latifi Jebelli; Stephen G. Kobourov; Richard Spence (Comput. Sci. Rev., 2020)

Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. - Greg Bodwin; Michael Dinitz; Caleb Robelle (SODA, 2021)

Multi-Level Weighted Additive Spanners. - Abu Reyan Ahmed; Greg Bodwin; Faryad Darabi Sahneh; Keaton Hamm; Stephen G. Kobourov; Richard Spence (SEA, 2021)

On Additive Spanners in Weighted Graphs with Local Error. - Abu Reyan Ahmed; Greg Bodwin; Keaton Hamm; Stephen G. Kobourov; Richard Spence (WG, 2021)

Weighted Sparse and Lightweight Spanners with Local Additive Error. - Abu Reyan Ahmed; Greg Bodwin; Keaton Hamm; Stephen G. Kobourov; Richard Spence (CoRR, 2021)

New Results on Linear Size Distance Preservers. - Greg Bodwin (SIAM J. Comput., 2021)

Better Distance Preservers and Additive Spanners. - Greg Bodwin; Virginia Vassilevska Williams (ACM Trans. Algorithms, 2021)

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

Vertex Fault-Tolerant Emulators. - Greg Bodwin; Michael Dinitz; Yasamin Nazari (ITCS, 2022)

Partially Optimal Edge Fault-Tolerant Spanners. - Greg Bodwin; Michael Dinitz; Caleb Robelle (SODA, 2022)

A note on distance-preserving graph sparsification. - Greg Bodwin (Inf. Process. Lett., 2022)

A unified view of graph regularity via matrix decompositions. - Greg Bodwin; Santosh S. Vempala (Random Struct. Algorithms, 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)

Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. - Greg Bodwin; Michael Dinitz; Yasamin Nazari (ITCS, 2023)

Opponent Indifference in Rating Systems: A Theoretical Case for Sonas. - Greg Bodwin; Forest Zhang (ITCS, 2023)

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. - Greg Bodwin; Merav Parter (J. ACM, 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)

Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? - Aaron Bernstein; Greg Bodwin; Nicole Wein (ITCS, 2024)

Spanning Adjacency Oracles in Sublinear Time. - Greg Bodwin; Henry L. Fleischmann (ITCS, 2024)

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. - Greg Bodwin; Bernhard Haeupler; Merav Parter (SODA, 2024)

Reachability Preservers: New Extremal Bounds and Approximation Algorithms. - Amir Abboud; Greg Bodwin (SIAM J. Comput., 2024)

Light Edge Fault Tolerant Graph Spanners. - Greg Bodwin; Michael Dinitz; Ama Koranteng; Lily Wang (ICALP, 2025)

A Lower Bound for Light Spanners in General Graphs. - Greg Bodwin; Jeremy Flics (SODA, 2025)

Improved Online Reachability Preservers. - Greg Bodwin; Tuong Le (SODA, 2025)

Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths. - Greg Bodwin; Lily Wang (SODA, 2025)

An Alternate Proof of Near-Optimal Light Spanners. - Greg Bodwin (TheoretiCS, 2025)

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

Notes on the Linear Algebraic View of Regularity Lemmas. - Greg Bodwin; Tuong Le (CoRR, 2025)