Convex drawings of hierarchical planar graphs and clustered planar graphs

Chrobak, 1997, Convex grid drawings of 3-connected planar graphs, International Journal of Computational Geometry and Applications, 7, 211, 10.1142/S0218195997000144 Chiba, 1984, Linear algorithms for convex drawings of planar graphs, 153 Cornelsen, 2006, Completely connected clustered graphs, J. Discrete Algorithms, 4, 313, 10.1016/j.jda.2005.06.002 Di Battista, 1998 Eades, 2006, Straight-line drawing algorithms for hierarchical graphs and clustered graphs, Algorithmica, 44, 1, 10.1007/s00453-004-1144-8 Q. Feng, Algorithms for drawing clustered graphs, Ph.D thesis, University of Newcastle, 1997 Even, 1976, Computing an st-numbering, Theoretical Computer Science, 2, 339, 10.1016/0304-3975(76)90086-4 Fáry, 1948, On straight line representations of planar graphs, Acta Sci. Math. Szeged, 11, 229 Hong, 2008, Convex drawings of graphs with non-convex boundary constraints, Discrete Applied Mathematics, 156, 2368, 10.1016/j.dam.2007.10.012 M. Jünger, S. Leipert, M. Percan, Triangulating clustered graphs, Technical report zaik2002-444, Zentrum für Angewandte Informatik Köln, 2002 Kamada, 2006, Convex grid drawings of plane graphs with rectangular contours, 131 2001, vol. 2025 Miura, 2006, Convex drawings of plane graphs of minimum outer apices, Int. J. Found. Comput. Sci., 17, 1115, 10.1142/S0129054106004297 Miura, 2006, Convex grid drawings of four-connected plane graphs, Int. J. Found. Comput. Sci., 17, 1031, 10.1142/S012905410600425X Nagamochi, 2007, Drawing c-planar biconnected clustered graphs, Discrete Applied Mathematics, 155, 1155, 10.1016/j.dam.2006.04.044 Nishizeki, 2004 Preparata, 1985 Thomassen, 1984, Plane representations of graphs, 43 Tutte, 1960, Convex representations of graphs, Proc. London Math. Soc., 10, 304, 10.1112/plms/s3-10.1.304 Tutte, 1963, How to draw a graph, Proc. London Math. Soc., 13, 743, 10.1112/plms/s3-13.1.743 Wagner, 1936, Bemerkungen zum Vierfarbenproblem, Jahresbericht Deutsch Math. Verein, 46, 26