{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:20Z","timestamp":1725880580295},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_12","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"149-160","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Measures for Mosaic Drawings"],"prefix":"10.1007","author":[{"given":"Quirijn W.","family":"Bouts","sequence":"first","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"3","key":"12_CR1","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., Ueckerdt, T.: Computing cartograms with optimal complexity. Discret. Comput. Geom. 50(3), 784\u2013810 (2013)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-319-27261-0_39","volume-title":"Graph Drawing and Network Visualization","author":"MJ Alam","year":"2015","unstructured":"Alam, M.J., Bl\u00e4sius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and voxel representations of graphs. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 472\u2013486. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-27261-0_39"},{"issue":"7","key":"12_CR3","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1016\/j.disc.2007.12.087","volume":"309","author":"M Berg de","year":"2009","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discret. Math. 309(7), 1794\u20131812 (2009)","journal-title":"Discret. Math."},{"issue":"3","key":"12_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/cgf.12648","volume":"34","author":"RG Cano","year":"2015","unstructured":"Cano, R.G., Buchin, K., Castermans, T., Pieterse, A., Sonke, W., Speckmann, B.: Mosaic drawings and cartograms. Comput. Graph. Forum 34(3), 361\u2013370 (2015)","journal-title":"Comput. Graph. Forum"},{"issue":"4","key":"12_CR5","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1137\/S0097539702411381","volume":"34","author":"YT Chiang","year":"2005","unstructured":"Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications. SIAM J. Comput. 34(4), 924\u2013945 (2005)","journal-title":"SIAM J. Comput."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-03841-4_14","volume-title":"Graph Drawing","author":"JJ Fowler","year":"2013","unstructured":"Fowler, J.J.: Strongly-connected outerplanar graphs with proper touching triangle representations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 155\u2013160. Springer, Heidelberg (2013). doi: 10.1007\/978-3-319-03841-4_14"},{"key":"12_CR7","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse 88, 141\u2013164 (1936)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"5","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 5(2), 145\u2013157 (1985)","journal-title":"Networks"},{"issue":"5","key":"12_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","volume":"13","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C.: Metrics for graph drawing aesthetics. J. Vis. Lang. Comput. 13(5), 501\u2013516 (2002)","journal-title":"J. Vis. Lang. Comput."},{"issue":"2","key":"12_CR10","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/208794","volume":"24","author":"E Raisz","year":"1934","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geogr. Rev. 24(2), 292\u2013296 (1934)","journal-title":"Geogr. Rev."},{"issue":"3","key":"12_CR11","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"s1\u201328","author":"P Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing maps. J. Lond. Math. Soc. s1\u201328(3), 336\u2013342 (1953)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:54:18Z","timestamp":1498388058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}