Greg Bodwin

Publications

For a full list of publications (with arxiv links), see my google scholar, or browse the list below.

Selected Publications

  1. The 4/3 Additive Spanner Exponent is Tight

    (STOC 2016 Best Student Paper, Full Version JACM 2017, Invited to HALG 2016 & SODM 2018), by Amir Abboud and Greg Bodwin

  2. On the Structure of Unique Shortest Paths in Graphs

    (SODA 2019, Invited to HALG 2019), by Greg Bodwin

  3. An Alternate Proof of Near-Optimal Light Spanners

    (SOSA 2024 Best Paper), by Greg Bodwin

  4. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

    (PODC 2021 Best Paper, Invited to HALG 2022, Full Version JACM 2023), by Greg Bodwin and Merav Parter

  5. Folklore Sampling is Optimal for Exact Hopsets

    (FOCS 2023, invited to HALG 2024), by Greg Bodwin and Gary Hoppenworth

All Publications

Including preprints, notes, surveys, and my thesis. Titles link to freely available versions.

  1. Unconditional Lower Bounds for Degree Fault Tolerant Spanners

    (ESA 2026), by Greg Bodwin and Aleksey Lopez

  2. Improved Upper Bounds for the Directed Flow-Cut Gap

    (FOCS 2026), by Greg Bodwin and Luba Samborska

  3. Simple Length-Constrained Expander Decompositions

    (SOSA 2026), by Greg Bodwin, Bernhard Haeupler, D Ellis Hershkowitz, and Zihan Tan

  4. Greedy Algorithms for Shortcut Sets and Hopsets

    (Preprint 2025), by Ben Bals, Joakim Blikstad, Greg Bodwin, Daniel Dadush, Sebastian Forster, and Yasamin Nazari

  5. Notes on the Linear Algebraic View of Regularity Lemmas

    (Notes 2025), by Greg Bodwin and Tuong Le

  6. Multiplicative Spanners in Minor-Free Graphs

    (Preprint 2025), by Greg Bodwin, Gary Hoppenworth, and Zihan Tan

  7. Light Edge Fault Tolerant Graph Spanners

    (ICALP 2025), by Greg Bodwin, Michael Dinitz, Ama Koranteng, and Lily Wang

  8. Improved Online Reachability Preservers

    (SODA 2025), by Greg Bodwin and Tuong Le

  9. A Lower Bound for Light Spanners in General Graphs

    (SODA 2025), by Greg Bodwin and Jeremy Flics

  10. Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths

    (SODA 2025), by Greg Bodwin and Lily Wang

  11. Additive Spanner Lower Bounds with Optimal Inner Graph Structure

    (ICALP 2024), by Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, and Zixuan Xu

  12. The Discrepancy of Shortest Paths

    (ICALP 2024), by Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, and Chen Wang

  13. Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

    (SODA 2024), by Greg Bodwin, Bernhard Haeupler, and Merav Parter

  14. Spanning Adjacency Oracles in Sublinear Time

    (ITCS 2024), by Greg Bodwin and Henry Fleischmann

  15. Are there graphs whose shortest path structure requires large edge weights?

    (ITCS 2024), by Aaron Bernstein, Greg Bodwin, and Nicole Wein

  16. An Alternate Proof of Near-Optimal Light Spanners

    (SOSA 2024 Best Paper, Full Version TheoretiCS 2025, Invited to HALG 2025), by Greg Bodwin

  17. Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier

    (FOCS 2023, Invited to HALG 2024), by Greg Bodwin and Gary Hoppenworth

  18. Bridge Girth: A Unifying Notion in Network Design

    (FOCS 2023), by Greg Bodwin, Gary Hoppenworth, and Ohad Trabelsi

  19. Opponent Indifference in Rating Systems: A Theoretical Case for Sonas

    (ITCS 2023), by Greg Bodwin and Forest Zhang

  20. Epic Fail: Emulators can tolerate polynomially many edge faults for free

    (ITCS 2023), by Greg Bodwin, Michael Dinitz, and Yasamin Nazari

  21. New Additive Spanner Lower Bounds by an Unlayered Obstacle Product

    (FOCS 2022), by Greg Bodwin and Gary Hoppenworth

  22. Vertex Fault-Tolerant Emulators

    (ITCS 2022), by Greg Bodwin, Michael Dinitz, and Yasamin Nazari

  23. Partially Optimal Edge Fault-Tolerant Spanners

    (SODA 2022), by Greg Bodwin, Michael Dinitz, and Caleb Robelle

  24. A Note on Distance-Preserving Graph Sparsification

    (Information Processing Letters 2022), by Greg Bodwin

  25. A Unified View of Graph Regularity via Matrix Decompositions

    (Random Structures & Algorithms 2022), by Greg Bodwin and Santosh Vempala

  26. Weighted Sparse and Lightweight Spanners with Local Additive Error

    (WG 2021), by Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen Kobourov, and Richard Spence

  27. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

    (PODC 2021 Best Paper, Invited to HALG 2022, Full Version JACM 2023), by Greg Bodwin and Merav Parter

  28. Multi-level Weighted Additive Spanners

    (SEA 2021), by Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence

  29. Optimal Vertex Fault-Tolerant Spanners in Polynomial Time

    (SODA 2021), by Greg Bodwin, Michael Dinitz, and Caleb Robelle

  30. New Fault Tolerant Subset Preservers

    (ICALP 2020), by Greg Bodwin, Keerti Choudhary, Merav Parter, and Noa Shahar

  31. Weighted Additive Spanners

    (WG 2020), by Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen Kobourov, and Richard Spence

  32. Strategy-Stealing is Non-Constructive

    (ITCS 2020), by Greg Bodwin and Ofer Grossman

  33. Graph Spanners: A Tutorial Review

    (Computer Science Review 2020), by Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, and Richard Spence

  34. A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners

    (PODC 2019), by Greg Bodwin and Shyamal Patel

  35. On the Structure of Unique Shortest Paths in Graphs

    (SODA 2019, Invited to HALG 2019), by Greg Bodwin

  36. Sketching Distances in Graphs

    (Ph.D. Thesis, MIT 2018; George M. Sprowls Award), by Greg Bodwin

  37. Reachability Preservers: New Extremal Bounds and Approximation Algorithms

    (SODA 2018, Full Version SICOMP 2024), by Amir Abboud and Greg Bodwin

  38. Optimal Vertex Fault Tolerant Spanners (for fixed stretch)

    (SODA 2018), by Greg Bodwin, Michael Dinitz, Merav Parter, and Virginia Vassilevska Williams

  39. Testing Core Membership in Public Goods Economies

    (ICALP 2017), by Greg Bodwin

  40. Preserving Distances in Very Faulty Graphs

    (ICALP 2017), by Greg Bodwin, Fabrizio Grandoni, Merav Parter, and Virginia Vassilevska Williams

  41. A Hierarchy of Lower Bounds for Sublinear Additive Spanners

    (SODA 2017, Full Version SICOMP 2019), by Amir Abboud, Greg Bodwin, and Seth Pettie

  42. New Results on Linear Size Distance Preservers

    (SODA 2017, Full Version SICOMP 2021), by Greg Bodwin

  43. Fully Dynamic Spanners with Worst-Case Update Time

    (ESA 2016), by Greg Bodwin and Sebastian Krinninger

  44. Graph Reconstruction with a Betweenness Oracle

    (STACS 2016), by Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, and Morten Stöckel

  45. Error Amplification for Pairwise Spanner Lower Bounds

    (SODA 2016), by Amir Abboud and Greg Bodwin

  46. The 4/3 Additive Spanner Exponent is Tight

    (STOC 2016 Best Student Paper, Full Version JACM 2017, Invited to HALG 2016 & SODM 2018), by Amir Abboud and Greg Bodwin

  47. Better Distance Preservers and Additive Spanners

    (SODA 2016, Full Version TALG 2021), by Greg Bodwin and Virginia Vassilevska Williams

  48. Very Sparse Additive Spanners and Emulators

    (ITCS 2015), by Greg Bodwin and Virginia Vassilevska Williams