Author:
Dujmović Vida,Wood David R.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23(1), 11–24 (1989)
2. Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica 17(2), 199–208 (1996)
3. Di Giacomo, E., Liotta, G., Wismath, S.: Drawing series-parallel graphs on a box. In: Proc. 14th Canadian Conf. on Computational Geometry (CCCG 2002), pp. 149–153. The Univ. of Lethbridge, Canada (2002)
4. Ding, G., Oporowski, B.: Some results on tree decomposition of graphs. J. Graph Theory 20(4), 481–499 (1995)
5. Dujmović, V., Morin, P., Wood, D.R.: Path-width and three-dimensional straight-line grid drawings of graphs. In: Advanced Symbolic Analysis for Compilers. LNCS, vol. 2628, pp. 42–53. Springer, Heidelberg (2002)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献