Follow
Greg Bodwin
Title
Cited by
Cited by
Year
The 4/3 additive spanner exponent is tight
A Abboud, G Bodwin
Journal of the ACM (JACM) 64 (4), 1-20, 2017
812017
A hierarchy of lower bounds for sublinear additive spanners
A Abboud, G Bodwin, S Pettie
SIAM Journal on Computing 47 (6), 2203-2236, 2018
702018
Better Distance Preservers and Additive Spanners
G Bodwin, VV Williams
ACM Transactions on Algorithms (TALG) 17 (4), 1-24, 2021
45*2021
New results on linear size distance preservers
G Bodwin
SIAM Journal on Computing 50 (2), 662-673, 2021
42*2021
Graph spanners: A tutorial review
R Ahmed, G Bodwin, FD Sahneh, K Hamm, MJL Jebelli, S Kobourov, ...
Computer Science Review 37, 100253, 2020
332020
Preserving distances in very faulty graphs
G Bodwin, F Grandoni, M Parter, VV Williams
arXiv preprint arXiv:1703.10293, 2017
282017
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
222018
Error amplification for pairwise spanner lower bounds
A Abboud, G Bodwin
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
212016
Fully dynamic spanners with worst-case update time
G Bodwin, S Krinninger
arXiv preprint arXiv:1606.07864, 2016
192016
On the structure of unique shortest paths in graphs
G Bodwin
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
182019
Very sparse additive spanners and emulators
G Bodwin, VV Williams
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
162015
Reachability preservers: New extremal bounds and approximation algorithms
A Abboud, G Bodwin
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
152018
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
142019
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
132016
A note on distance-preserving graph sparsification
G Bodwin
Information Processing Letters 174, 106205, 2022
11*2022
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
92021
Weighted additive spanners
R Ahmed, G Bodwin, F Darabi Sahneh, S Kobourov, R Spence
International Workshop on Graph-Theoretic Concepts in Computer Science, 401-413, 2020
82020
Weighted sparse and lightweight spanners with local additive error
R Ahmed, G Bodwin, K Hamm, S Kobourov, R Spence
arXiv e-prints, arXiv: 2103.09731, 2021
42021
Multi-level weighted additive spanners
R Ahmed, G Bodwin, FD Sahneh, K Hamm, S Kobourov, R Spence
arXiv preprint arXiv:2102.05831, 2021
42021
A unified view of graph regularity via matrix decompositions
G Bodwin, S Vempala
Random Structures & Algorithms, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20