Information Technology Reference
In-Depth Information
12. Demaine, E.D., O'Rourke, J.: Geometric Folding Algorithms: Linkages, Origami,
Polyhedra. Cambridge University Press (2007)
13. Di Battista, G., Nardelli, E.: Hierarchies and planarity theory. IEEE Trans. Systems
Man Cybernet. 18(6), 1035-1046 (1988)
14. Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms.
In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, ch. 7, pp.
223-246. Chapman and Hall/CRC (2013)
15. Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unla-
beled level planar trees. Comput. Geom. Th. Appl. 42(6-7), 704-721 (2009)
16. Garg, A.: New results on drawing angle graphs. Comput. Geom. Th. Appl. 9(1),
43-82 (1998)
17. Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109-133 (1995)
18. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear
planarity testing. SIAM J. Comput. 31(2), 601-625 (2001)
19. Harrigan, M., Healy, P.: Practical level planarity testing and layout with embed-
ding constraints. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS,
vol. 4875, pp. 62-68. Springer, Heidelberg (2008)
20. Hull, T.C.: The combinatorics of flat folds: a survey. In: Hull, T.C. (ed.) Origami
3
(Asilomar, CA, 2001), pp. 29-38. A K Peters, Natick (2002)
21. Junger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: White-
sides, S.H. (ed.) GD 1998. LNCS, vol. 1547, p. 224. Springer, Heidelberg (1999)
22. Pach, J., Toth, G.: Monotone drawings of planar graphs. J. Graph Theory 46(1),
39-47 (2004)
23. Ribo Mor, A.: Realization and counting problems for planar structures. Ph.D.
thesis, Free Univ. Berlin (2006)
24. Saxe, J.: Embeddability of weighted graphs in
k
-space is strongly NP-hard. In:
Proc. 17th Allerton Conf. Commun. Control Comput., pp. 480-489 (1979)
25. Schaefer, M.: Realizability of graphs and linkages. In: Pach, J. (ed.) Thirty Essays
on Geometric Graph Theory, pp. 461-482. Springer, New York (2013)
26. Streinu, I., Whiteley, W.: Single-vertex origami and spherical expansive motions.
In: Akiyama, J., Kano, M., Tan, X. (eds.) JCDCG 2004. LNCS, vol. 3742, pp.
161-173. Springer, Heidelberg (2005),
http://dx.doi.org/10.1007/11589440_17
27. Tamassia, R.: On embedding a graph in the grid with the minimum number of
bends. SIAM J. Comput. 16(3), 421-444 (1987)
28. Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM J.
Comput. 14(2), 355-372 (1985)
