Author:
Bhatt Sandeep,Chung Fan,Leighton Tom,Rosenberg Arnold
Cited by
89 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Sparse universal graphs for planarity;Journal of the London Mathematical Society;2023-07-02
2. Better Hardness Results for the Minimum Spanning Tree Congestion Problem;WALCOM: Algorithms and Computation;2023
3. New Additive Spanner Lower Bounds by an Unlayered Obstacle Product;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Hardness and efficiency on t-admissibility for graph operations;Discrete Applied Mathematics;2021-12
5. Edge Tree Spanners;AIRO Springer Series;2020-11-09