Information Technology Reference
In-Depth Information
Acknowledgement.
We thank the anonymous reviewers for their detailed feed-
back to improve the presentation of the paper.
References
1. Biedl, T.: Height-preserving transformations of planar graph drawings. In: Dun-
can, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 380-391. Springer,
Heidelberg (2014)
2. Biedl, T.: A 4-approximation for the height of drawing 2-connected outer-planar
graphs. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846,
pp. 272-285. Springer, Heidelberg (2013)
3. Biedl, T.C.: Transforming planar graph drawings while maintaining height. CoRR
abs/1308.6693 (2013),
http://arxiv.org/abs/1308.6693
4. Bonichon, N., Le Saec, B., Mosbah, M.: Wagner's Theorem on Realizers. In: Wid-
mayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.)
ICALP 2002. LNCS, vol. 2380, pp. 1043-1053. Springer, Heidelberg (2002)
5. Brandenburg, F.J.: Drawing planar graphs on
9
n
2
area. Electronic Notes in Dis-
crete Mathematics 31, 37-40 (2008)
6. Chrobak, M., Nakano, S.: Minimum width grid drawings of plane graphs. In:
Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 104-110. Springer,
Heidelberg (1995)
7. De Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid.
Combinatorica 10(1), 41-51 (1990)
8. Djidjev, H., Venkatesan, S.M.: Reduced constants for simple cycle graph separation.
Acta Informatica 34(3), 231-243 (1997)
9. Dujmovic, V., et al.: On the parameterized complexity of layered graph drawing. In:
Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 488-499. Springer,
Heidelberg (2001)
10. Frati, F., Patrignani, M.: A note on minimum-area straight-line drawings of planar
graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875,
pp. 339-344. Springer, Heidelberg (2008)
11. Hossain, M.I., Mondal, D., Rahman, M.S., Salma, S.A.: Universal line-sets for
drawing planar 3-trees. Journal of Graph Algorithms and Applications 17(2),
59-79 (2013)
12. Jordan, C.: Sur les assemblages de lignes. Journal fur die reine und angewandte
Mathematik 70(2), 185-190 (1969)
13. Mondal, D., Alam, M.J., Rahman, M.S.: Minimum-layer drawings of trees -
(extended abstract). In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS,
vol. 6552, pp. 221-232. Springer, Heidelberg (2011)
14. Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of
plane 3-trees. Journal of Graph Algorithms and Applications 15(2), 177-204 (2011)
15. Pach, J., Toth, G.: Monotone drawings of planar graphs. Journal of Graph The-
ory 46(1), 39-47 (2004)
16. Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of ACM-
SIAM SODA, January 22-24, pp. 138-148. ACM (1990)
17. Suderman, M.: Pathwidth and layered drawing of trees. Journal of Computational
Geometry & Applications 14(3), 203-225 (2004)
18. Suderman, M.: Pathwidth and layered drawings of trees. International Journal of
Computational Geometry and Applications 14, 203-225 (2004)
