Cited By
View all- Abboud ABringmann KKhoury SZamir OLeonardi SGupta A(2022)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyondProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520066(1487-1500)Online publication date: 9-Jun-2022
- Bodwin GWilliams V(2021)Better Distance Preservers and Additive SpannersACM Transactions on Algorithms10.1145/349014717:4(1-24)Online publication date: 5-Oct-2021
- Chlamtáč EDinitz MKortsarz GLaekhanukit B(2020)Approximating Spanners and Directed Steiner ForestACM Transactions on Algorithms10.1145/338145116:3(1-31)Online publication date: 12-Jun-2020
- Show More Cited By