{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:59Z","timestamp":1759638419876},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_17","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"198-210","source":"Crossref","is-referenced-by-count":3,"title":["On Area-Optimal Planar Graph Drawings"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Biedl, T., Vatshelle, M.: The point-set embeddability problem for plane graphs. International Journal of Computational Geometry and Applications (in press, 2014)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.endm.2008.06.005","volume":"31","author":"F. Brandenburg","year":"2008","unstructured":"Brandenburg, F.: Drawing planar graphs on (8\/9)*n2 area. Electronic Notes in Discrete Mathematics\u00a031, 37\u201340 (2008)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"7","key":"17_CR3","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.dam.2009.10.011","volume":"158","author":"F. Dorn","year":"2010","unstructured":"Dorn, F.: Dynamic programming and planarity: Improved tree-decomposition based algorithms. Discrete Applied Mathematics\u00a0158(7), 800\u2013808 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"17_CR4","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Scientiarum Mathematicarum (Szeged)\u00a011(4), 229\u2013233 (1948)","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S. Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. Journal of Graph Algorithms and Applications\u00a07(4), 335\u2013362 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"17_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-77537-9_21","volume-title":"Graph Drawing","author":"M. Krug","year":"2008","unstructured":"Krug, M., Wagner, D.: Minimizing the area for planar straight-line grid drawings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 207\u2013212. Springer, Heidelberg (2008)"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00222","volume":"15","author":"D. Mondal","year":"2011","unstructured":"Mondal, D., Nishat, R.I.: Md.\u00a0S. Rahman, and Md.\u00a0J. Alam. Minimum-area drawings of plane 3-trees. J. Graph Algorithms Appl.\u00a015(2), 177\u2013204 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions in tree-decompositions. J. Combin. Theory Ser. B\u00a052, 153\u2013190 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR11","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Stein, S.: Convex maps, vol.\u00a02, pp. 464\u2013466. American Mathematical Society (1951)","DOI":"10.2307\/2031777"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. London Math. Soc.\u00a010(3), 304\u2013320 (1960)","journal-title":"Proc. London Math. Soc."},{"key":"17_CR14","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung\u00a046, 26\u201332 (1936)","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:26:49Z","timestamp":1558924009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}