Author:
Battista Giuseppe Di,Frati Fabrizio
Reference126 articles.
1. G.E. Andrews, A lower bound for the volumes of strictly convex bodies with many boundary points. Trans. Am. Math. Soc. 106, 270–279 (1963)
2. P. Angelini, G. Di Battista, F. Frati, Succinct greedy drawings do not always exist, in Graph Drawing (GD’09), ed. by D. Eppstein, E.R. Gansner. LNCS, Springer, vol. 5849 (2010) pp. 171–182
3. P. Angelini, T. Bruckdorfer, M. Chiesa, F. Frati, M. Kaufmann, C. Squarcella, On the area requirements of Euclidean minimum spanning trees (2011), manuscript
4. P. Angelini, F. Frati, L. Grilli, An algorithm to construct greedy drawings of triangulations. J. Graph Algorithm. Appl. 14(1), 19–51 (2010)
5. P. Angelini, F. Frati, M. Kaufmann, Straight-line rectangular drawings of clustered graphs. Discr. Comput. Geom. 45(1), 88–140 (2011)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献