Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;N. Bonichon,2002
2. Lecture Notes in Computer Science;H.-L. Chen,2002
3. Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. of the 12th Annual ACM-SIAM SODA, pp. 506–515. ACM Press, New York (2001)
4. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
5. He, X.: On finding the rectangular duals of planar triangular graphs. SIAM Journal on Computing 22, 1218–1226 (1993)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献