Publisher
Springer International Publishing
Reference24 articles.
1. Lecture Notes in Computer Science;S Alamdari,2013
2. Angelini, P., et al.: Greedy rectilinear drawings. Arxiv report 1808.09063 (2018).
http://arxiv.org/abs/1808.09063
3. Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. Networks 59(3), 267–274 (2012).
https://doi.org/10.1002/net.21449
4. Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Algorithms Appl. 14(1), 19–51 (2010).
https://doi.org/10.7155/jgaa.00197
5. Batini, C., Nardelli, E., Tamassia, R.: A layout algorithm for data flow diagrams. IEEE Trans. Software Eng. 12(4), 538–546 (1986).
https://doi.org/10.1109/TSE.1986.6312901
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献