Unit-length Rectangular Drawings of Graphs-Reference-Cited by-同舟云学术

Unit-length Rectangular Drawings of Graphs

Published:2023 Issue: Volume: Page:127-143
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Alegría Carlos^ORCID,Da Lozzo Giordano^ORCID,Di Battista Giuseppe^ORCID,Frati Fabrizio^ORCID,Grosso Fabrizio^ORCID,Patrignani Maurizio^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-22203-0_10

Reference50 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. Lecture Notes in Computer Science;C Alegría,2021

3. Alegría, C., Da Lozzo, G., Di Battista, G., Frati, F., Grosso, F., Patrignani, M.: Unit-length rectangular drawings of graphs. CoRR abs/2208.14142 (2022). https://arxiv.org/abs/2208.14142

4. Lecture Notes in Computer Science;P Angelini,2014

5. Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Arge, L., Pach, J. (eds.) 31st International Symposium on Computational Geometry, SoCG 2015, 22–25 June 2015, Eindhoven, The Netherlands. LIPIcs, vol. 34, pp. 126–140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015). https://doi.org/10.4230/LIPIcs.SOCG.2015.126

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An annotated review on graph drawing and its applications;AKCE International Journal of Graphs and Combinatorics;2023-07-11