Author:
Alegría Carlos,Borrazzo Manuel,Da Lozzo Giordano,Di Battista Giuseppe,Frati Fabrizio,Patrignani Maurizio
Publisher
Springer International Publishing
Reference47 articles.
1. Abel, Z., Demaine, E.D., Demaine, M.L., Eisenstat, S., Lynch, J., Schardl, T.B.: Who needs crossings? Hardness of plane graph rigidity. In: Fekete, S.P., Lubiw, A. (eds.) 32nd International Symposium on Computational Geometry (SoCG 2016). LIPIcs, vol. 51, pp. 3:1–3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016). https://doi.org/10.4230/LIPIcs.SoCG.2016.3
2. Alegría, C., Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Planar straight-line realizations of 2-trees with prescribed edge lengths. CoRR abs/2108.09483 (2021). https://arxiv.org/abs/2108.09483
3. Alon, N., Feldheim, O.N.: Drawing outerplanar graphs using three edge lengths. Comput. Geom. 48(3), 260–267 (2015). https://doi.org/10.1016/j.comgeo.2014.10.006
4. Lecture Notes in Computer Science;P Angelini,2014
5. Angelini, P., et al.: Windrose planarity: embedding graphs with direction-constrained edges. ACM Trans. Algorithms 14(4), 54:1–54:24 (2018). https://doi.org/10.1145/3239561
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Unit-length Rectangular Drawings of Graphs;Lecture Notes in Computer Science;2023