Author:
Frati Fabrizio,Kaufmann Michael
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference37 articles.
1. P. Angelini, T. Bruckdorfer, M. Chiesa, F. Frati, M. Kaufmann, C. Squarcella, On the area requirements of Euclidean minimum spanning trees, Tech. report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2010.
2. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems;Arora;Journal of the ACM,1998
3. Approximation schemes for degree-restricted MST and red–blue separation problems;Arora;Algorithmica,2004
4. Rectangle of influence drawings of graphs without filled 3-cycles;Biedl,1999
5. Characterizing proximity trees;Bose;Algorithmica,1996
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Drawing Graphs as Spanners;Discrete & Computational Geometry;2022-06-06
2. On the area requirements of Euclidean minimum spanning trees;Computational Geometry;2014-02
3. The Approximate Rectangle of Influence Drawability Problem;Algorithmica;2014-01-15
4. Drawings of Graphs;Discrete Mathematics and Its Applications;2013-11-26
5. PROXIMITY DRAWINGS OF HIGH-DEGREE TREES;International Journal of Computational Geometry & Applications;2013-06