{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:36:10Z","timestamp":1742938570866,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_14","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T16:39:25Z","timestamp":1474994365000},"page":"158-170","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Planar Graphs with Prescribed Face\u00a0Areas"],"prefix":"10.1007","author":[{"given":"Linda","family":"Kleist","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","first-page":"26","volume-title":"Graph Drawing","author":"MJ Alam","year":"2011","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 26\u201338. Springer, Heidelberg (2011)"},{"issue":"3","key":"14_CR2","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckert, T.: Computing cartograms with optimal complexity. Discret. Comput. Geom. 50(3), 784\u2013810 (2013)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"14_CR3","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.comgeo.2012.09.004","volume":"46","author":"TC Biedl","year":"2013","unstructured":"Biedl, T.C., Vel\u00e1zquez, L.E.R.: Drawing planar 3-trees with given face areas. Comput. Geom. 46(3), 276\u2013285 (2013)","journal-title":"Comput. Geom."},{"key":"14_CR4","unstructured":"Debrunner, H.: Aufgabe 260. Elemente der Mathematik 12 (1957)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/110834032","volume":"41","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537\u2013564 (2012)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.7155\/jgaa.00320","volume":"18","author":"S Felsner","year":"2014","unstructured":"Felsner, S.: Exploiting air-pressure to map floorplans on point sets. J. Graph Algorithms Appl. 18(2), 233\u2013252 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR7","first-page":"109","volume":"63","author":"H de Fraysseix","year":"1991","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Representation of planar graphs. J. Intuitive Geom. 63, 109\u2013117 (1991)","journal-title":"J. Intuitive Geom."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3, 233\u2013246 (1994)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"14_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IA Hartman","year":"1991","unstructured":"Hartman, I.A., Newman, I., Ziv, R.: On grid intersection graphs. Discret. Math. 87(1), 41\u201352 (1991)","journal-title":"Discret. Math."},{"key":"14_CR10","unstructured":"Ringel, G.: Equiareal graphs. In: Contemporary Methods in Graph Theory, in honour of Prof. Dr. K. Wagner, pp. 503\u2013505 (1990)"},{"key":"14_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/b15385","volume-title":"Handbook of Graph Drawing and Visualization","author":"R Tamassia","year":"2013","unstructured":"Tamassia, R.: Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"},{"issue":"371\u2013381","key":"14_CR12","first-page":"2","volume":"1","author":"C Thomassen","year":"1992","unstructured":"Thomassen, C.: Plane cubic graphs with prescribed face areas. Comb. Probab. Comput. 1(371\u2013381), 2\u201310 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/31.1739","volume":"35","author":"S Wimer","year":"1988","unstructured":"Wimer, S., Koren, I., Cederbaum, I.: Floorplans, planar graphs, and layouts. IEEE Trans. Circuits Syst. 35, 267\u2013278 (1988)","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T08:32:38Z","timestamp":1601109158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}