受强制性开放获取政策约束的文章 - Greg Bodwin了解详情
可在其他位置公开访问的文章：17 篇
The 4/3 additive spanner exponent is tight
A Abboud, G Bodwin
Journal of the ACM (JACM) 64 (4), 1-20, 2017
强制性开放获取政策： US National Science Foundation
Graph spanners: A tutorial review
R Ahmed, G Bodwin, FD Sahneh, K Hamm, MJL Jebelli, S Kobourov, ...
Computer Science Review 37, 100253, 2020
强制性开放获取政策： US National Science Foundation
A hierarchy of lower bounds for sublinear additive spanners
A Abboud, G Bodwin, S Pettie
SIAM Journal on Computing 47 (6), 2203-2236, 2018
强制性开放获取政策： US National Science Foundation
Better distance preservers and additive spanners
G Bodwin, VV Williams
ACM Transactions on Algorithms (TALG) 17 (4), 1-24, 2021
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
Error amplification for pairwise spanner lower bounds
A Abboud, G Bodwin
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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, 5, 2016
强制性开放获取政策： Danish Council for Independent Research, Villum Foundation
Partially optimal edge fault-tolerant spanners
G Bodwin, M Dinitz, C Robelle
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
强制性开放获取政策： US National Science Foundation
A note on distance-preserving graph sparsification
G Bodwin
Information Processing Letters 174, 106205, 2022
强制性开放获取政策： US National Science Foundation
Bridge girth: A unifying notion in network design
G Bodwin, G Hoppenworth, O Trabelsi
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation, Netherlands Organisation for Scientific Research
New additive spanner lower bounds by an unlayered obstacle product
G Bodwin, G Hoppenworth
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
强制性开放获取政策： US National Science Foundation
Folklore sampling is optimal for exact hopsets: Confirming the√ n barrier
G Bodwin, G Hoppenworth
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation
A unified view of graph regularity via matrix decompositions
G Bodwin, S Vempala
Random Structures & Algorithms 61 (1), 62-83, 2022
强制性开放获取政策： US National Science Foundation
An alternate proof of near-optimal light spanners
G Bodwin
2024 Symposium on Simplicity in Algorithms (SOSA), 39-55, 2024
强制性开放获取政策： US National Science Foundation
New fault tolerant subset preservers
G Bodwin, K Choudhary, M Parter, N Shahar
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
强制性开放获取政策： US National Science Foundation, European Commission
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
G Bodwin, B Haeupler, M Parter
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
强制性开放获取政策： US National Science Foundation, European Commission
出版信息和资助信息由计算机程序自动确定