Publisher
Springer International Publishing
Reference49 articles.
1. Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824–852 (2017). https://doi.org/10.1137/16M1069171
2. Aleksandrov, L., Djidjev, H.: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math. 9(1), 129–150 (1996). https://doi.org/10.1137/S0895480194272183
3. Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the 32nd Annual ACM-SIAM Symposium Discrete Algorithms, October 2021. https://doi.org/10.1137/1.9781611976465.32
4. Alon, N., Yuster, R.: Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60(4), 25:1–25:8 (2013). https://doi.org/10.1145/2508028.2505989
5. Angelini, P., Lozzo, G.D., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Proceedings of 31st International Symposium on Computational Geometry, pp. 126–140. No. 34 in Leibniz International Proceedings in Informatics (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献