{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:39:15Z","timestamp":1766378355773,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000782","name":"European Science Foundation","doi-asserted-by":"publisher","award":["Wo 758\/5-1"],"award-info":[{"award-number":["Wo 758\/5-1"]}],"id":[{"id":"10.13039\/501100000782","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000782","name":"European Science Foundation","doi-asserted-by":"publisher","award":["Wo 758\/5-1"],"award-info":[{"award-number":["Wo 758\/5-1"]}],"id":[{"id":"10.13039\/501100000782","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1115971"],"award-info":[{"award-number":["CCF-1115971"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1115971"],"award-info":[{"award-number":["CCF-1115971"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DEB 1053573"],"award-info":[{"award-number":["DEB 1053573"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DEB 1053573"],"award-info":[{"award-number":["DEB 1053573"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00453-016-0121-3","type":"journal-article","created":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T14:04:19Z","timestamp":1453903459000},"page":"902-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved Approximation Algorithms for Box Contact Representations"],"prefix":"10.1007","volume":"77","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Fink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,27]]},"reference":[{"key":"121_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2014.05.025","volume":"175","author":"E Ackerman","year":"2014","unstructured":"Ackerman, E.: A note on 1-planar graphs. Discrete Appl. Math. 175, 104\u2013108 (2014)","journal-title":"Discrete Appl. Math."},{"key":"121_CR2","volume-title":"The Probabilistic Method","author":"N Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley, Hoboken (1992)"},{"key":"121_CR3","doi-asserted-by":"crossref","unstructured":"Barth, L., Fabrikant, S.I., Kobourov, S., Lubiw, A., N\u00f6llenburg, M., Okamoto, Y., Pupyrev, S., Squarcella, C., Ueckerdt, T., Wolff, A.: Semantic word cloud representations: hardness and approximation algorithms. In: Pardo, A., Viola, A. (eds) Proceedings of 11th Latin American Symposium Theoritical Information (LATIN\u201914), vol 8392 of Lecture Notes in Computer Science, pp 514\u2013525. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54423-1_45"},{"key":"121_CR4","doi-asserted-by":"crossref","unstructured":"Barth, L., Kobourov, S., Pupyrev, S.: Experimental comparison of semantic word clouds. In: Gudmundsson, J., Katajainen, J. (eds) Proceedings of 13th International Symposium on Experimental Algorithms (SEA\u201914), vol 8504 of Lecture Notes in Computer Science, pp 247\u2013258. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-07959-2_21"},{"issue":"6","key":"121_CR5","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1137\/090772988","volume":"40","author":"P Briest","year":"2011","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. SIAM J. Comput. 40(6), 1587\u20131622 (2011)","journal-title":"SIAM J. Comput."},{"key":"121_CR6","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1) (2008)","DOI":"10.1145\/1328911.1328919"},{"key":"121_CR7","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proceedings of 11th Annual ACM-SIAM Symposum Discrete Algorithms (SODA\u201900), pp 213\u2013222. SIAM (2000)"},{"issue":"4","key":"121_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R Cohen","year":"2006","unstructured":"Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett. 100(4), 162\u2013166 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"121_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MCG.2010.102","volume":"30","author":"W Cui","year":"2010","unstructured":"Cui, W., Wu, Y., Liu, S., Wei, F., Zhou, M., Qu, H.: Context-preserving dynamic word cloud visualization. IEEE Comput. Graph. Appl. 30(6), 42\u201353 (2010)","journal-title":"IEEE Comput. Graph. Appl."},{"key":"121_CR10","doi-asserted-by":"crossref","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds), Proc. 13th International Symposium on Graph Drawing (GD\u201905), vol 3843 of Lecture Notes in Computer Science, pp. 153\u2013164. Springer, Heidelberg (2005)","DOI":"10.1007\/11618058_15"},{"issue":"3","key":"121_CR11","doi-asserted-by":"publisher","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":"1","key":"121_CR12","first-page":"457","volume":"22","author":"G Erkan","year":"2004","unstructured":"Erkan, G., Radev, D.R.: Lexrank: graph-based lexical centrality as salience in text summarization. J. Artif. Int. Res. 22(1), 457\u2013479 (2004)","journal-title":"J. Artif. Int. Res."},{"key":"121_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-1-4614-0110-0_12","volume-title":"Thirty Essays on Geometric Graph Theory","author":"S Felsner","year":"2013","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 213\u2013248. Springer, Heidelberg (2013)"},{"issue":"3","key":"121_CR14","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/moor.1110.0499","volume":"36","author":"L Fleischer","year":"2011","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V., Sviridenko, M.: Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res. 36(3), 416\u2013431 (2011)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"121_CR15","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"121_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00198","volume":"14","author":"ER Gansner","year":"2010","unstructured":"Gansner, E.R., Hu, Y.: Efficient, proximity-preserving node overlap removal. J. Graph Algorithms Appl. 14(1), 53\u201374 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1\u20133","key":"121_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0012-365X(94)00313-8","volume":"149","author":"SL Hakimi","year":"1996","unstructured":"Hakimi, S.L., Mitchem, J., Schmeichel, E.F.: Star arboricity of graphs. Discrete Math. 149(1\u20133), 93\u201398 (1996)","journal-title":"Discrete Math."},{"issue":"1","key":"121_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S1351324902002838","volume":"8","author":"H Li","year":"2002","unstructured":"Li, H.: Word clustering and disambiguation based on co-occurrence data. J. Nat. Lang. Eng. 8(1), 25\u201342 (2002)","journal-title":"J. Nat. Lang. Eng."},{"key":"121_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"121_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T Nishizeki","year":"1979","unstructured":"Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28(3), 255\u2013267 (1979)","journal-title":"Discrete Math."},{"issue":"4","key":"121_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.7155\/jgaa.00299","volume":"17","author":"M N\u00f6llenburg","year":"2013","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. 17(4), 441\u2013473 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"121_CR22","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1111\/j.1467-8659.2012.03107.x","volume":"31","author":"FV Paulovich","year":"2012","unstructured":"Paulovich, F.V., Toledo, F.M.B., Telles, G.P., Minghim, R., Nonato, L.G.: Semantic wordification of document collections. Comput. Graph. Forum 31(3), 1145\u20131153 (2012)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"121_CR23","doi-asserted-by":"publisher","first-page":"292","DOI":"10.2307\/208794","volume":"24","author":"E Raisz","year":"1934","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geogr. Rev. 24(3), 292\u2013296 (1934)","journal-title":"Geogr. Rev."},{"issue":"6","key":"121_CR24","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1109\/TVCG.2009.171","volume":"15","author":"FB Vi\u00e9gas","year":"2009","unstructured":"Vi\u00e9gas, F.B., Wattenberg, M., Feinberg, J.: Participatory visualization with Wordle. IEEE Trans. Visual. Comput. Graphics 15(6), 1137\u20131144 (2009)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"key":"121_CR25","unstructured":"Weiland, S.: Der Koalitionsvertrag im Schnellcheck (Quick overview of the [German] coalition agreement). Spiegel Online, \n                    www.spiegel.de\/politik\/deutschland\/was-der-koalitionsvertrag-deutschland-bringt-a-935856.html\n                    \n                   Click on \u201cFotos\u201d, 27 Nov. 2013"},{"issue":"3","key":"121_CR26","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1111\/j.1467-8659.2011.01923.x","volume":"30","author":"Y Wu","year":"2011","unstructured":"Wu, Y., Provan, T., Wei, F., Liu, S., Ma, K.-L.: Semantic-preserving word clouds by seam carving. Comput. Graph. Forum 30(3), 741\u2013750 (2011)","journal-title":"Comput. Graph. Forum"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0121-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0121-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0121-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0121-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:31:44Z","timestamp":1589697104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0121-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,27]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0121-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2016,1,27]]},"assertion":[{"value":"6 November 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}