| The 4/3 additive spanner exponent is tight A Abboud, G Bodwin Journal of the ACM (JACM) 64 (4), 1-20, 2017 | 63 | 2017 |
| A hierarchy of lower bounds for sublinear additive spanners A Abboud, G Bodwin, S Pettie SIAM Journal on Computing 47 (6), 2203-2236, 2018 | 49 | 2018 |
| Better distance preservers and additive spanners G Bodwin, VV Williams Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 36 | 2016 |
| Linear size distance preservers G Bodwin Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 34 | 2017 |
| Preserving distances in very faulty graphs G Bodwin, F Grandoni, M Parter, VV Williams arXiv preprint arXiv:1703.10293, 2017 | 21 | 2017 |
| Optimal vertex fault tolerant spanners (for fixed stretch) G Bodwin, M Dinitz, M Parter, VV Williams Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 16 | 2018 |
| Fully dynamic spanners with worst-case update time G Bodwin, S Krinninger arXiv preprint arXiv:1606.07864, 2016 | 16 | 2016 |
| Error amplification for pairwise spanner lower bounds A Abboud, G Bodwin Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 16 | 2016 |
| Very sparse additive spanners and emulators G Bodwin, VV Williams Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 12 | 2015 |
| A trivial yet optimal solution to vertex fault tolerant spanners G Bodwin, S Patel Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 11 | 2019 |
| Reachability preservers: New extremal bounds and approximation algorithms A Abboud, G Bodwin Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 11 | 2018 |
| Graph spanners: A tutorial review R Ahmed, G Bodwin, FD Sahneh, K Hamm, MJL Jebelli, S Kobourov, ... Computer Science Review 37, 100253, 2020 | 10 | 2020 |
| On the structure of unique shortest paths in graphs G Bodwin Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 9 | 2019 |
| Graph reconstruction with a betweenness oracle M Abrahamsen, G Bodwin, E Rotenberg, M Stöckel 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016 | 6 | 2016 |
| A note on distance-preserving graph sparsification G Bodwin arXiv e-prints, arXiv: 2001.07741, 2020 | 5* | 2020 |
| Optimal vertex fault-tolerant spanners in polynomial time G Bodwin, M Dinitz, C Robelle Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 3 | 2021 |
| Weighted additive spanners R Ahmed, G Bodwin, FD Sahneh, S Kobourov, R Spence International Workshop on Graph-Theoretic Concepts in Computer Science, 401-413, 2020 | 3 | 2020 |
| Testing core membership in public goods economies G Bodwin arXiv preprint arXiv:1705.01570, 2017 | 2 | 2017 |
| New Fault Tolerant Subset Preservers G Bodwin, K Choudhary, M Parter, N Shahar 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 1 | 2020 |
| A Unified View of Graph Regularity via Matrix Decompositions G Bodwin, S Vempala arXiv preprint arXiv:1911.11868, 2019 | 1 | 2019 |
