{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:39:30Z","timestamp":1766378370688},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_45","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"514-525","source":"Crossref","is-referenced-by-count":19,"title":["Semantic Word Cloud Representations: Hardness and Approximation Algorithms"],"prefix":"10.1007","author":[{"given":"Lukas","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara Irina","family":"Fabrikant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Squarcella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","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. Arxiv report arxiv.org\/abs\/1311.4778 (2013)","DOI":"10.1007\/978-3-642-54423-1_45"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328919"},{"issue":"3","key":"45_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C. Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput.\u00a035(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Collins, C., Vi\u00e9gas, F.B., Wattenberg, M.: Parallel tag clouds to explore and analyze faceted text corpora. In: Proc. IEEE Symp. Vis. Analytics Sci. Tech., pp. 91\u201398 (2009)","DOI":"10.1109\/VAST.2009.5333443"},{"issue":"6","key":"45_CR5","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. Graphics Appl.\u00a030(6), 42\u201353 (2010)","journal-title":"IEEE Comput. Graphics Appl."},{"issue":"1","key":"45_CR6","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/aris.1440380105","volume":"38","author":"S.T. Dumais","year":"2004","unstructured":"Dumais, S.T.: Latent semantic analysis. Annu. Rev. Inform. Sci. Tech.\u00a038(1), 188\u2013230 (2004)","journal-title":"Annu. Rev. Inform. Sci. Tech."},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11618058_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 153\u2013164. Springer, Heidelberg (2006)"},{"issue":"3","key":"45_CR8","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.\u00a041(3), 537\u2013564 (2012)","journal-title":"SIAM J. Comput."},{"key":"45_CR9","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":"45_CR10","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.S., Sviridenko, M.: Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res.\u00a036(3), 416\u2013431 (2011)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"45_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00198","volume":"14","author":"E.R. Gansner","year":"2010","unstructured":"Gansner, E.R., Hu, Y.: Efficient, proximity-preserving node overlap removal. J. Graph Algortihms Appl.\u00a014(1), 53\u201374 (2010)","journal-title":"J. Graph Algortihms Appl."},{"key":"45_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1-3","key":"45_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(94)00313-8","volume":"149","author":"S.L. Hakimi","year":"1996","unstructured":"Hakimi, S.L., Mitchem, J., Schmeichel, E.F.: Star arboricity of graphs. Discrete Math.\u00a0149(1-3), 93\u201398 (1996)","journal-title":"Discrete Math."},{"issue":"6","key":"45_CR14","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1109\/TVCG.2010.175","volume":"16","author":"K. Koh","year":"2010","unstructured":"Koh, K., Lee, B., Kim, B.H., Seo, J.: Maniwordle: Providing flexible control over Wordle. IEEE Trans. Vis. Comput. Graph.\u00a016(6), 1190\u20131197 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"45_CR15","unstructured":"Lagus, K., Honkela, T., Kaski, S., Kohonen, T.: Self-organizing maps of document collections: A new approach to interactive exploration. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) KDD 1996, pp. 238\u2013243. AAAI Press (1996)"},{"issue":"3","key":"45_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J.Y.T. Leung","year":"1990","unstructured":"Leung, J.Y.T., Tam, T.W., Wong, C., Young, G.H., Chin, F.Y.: Packing squares into a square. J. Parallel Distrib. Comput.\u00a010(3), 271\u2013275 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"45_CR17","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/070682150","volume":"38","author":"C.T. Nguyen","year":"2008","unstructured":"Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM J. Comput.\u00a038(3), 946\u2013962 (2008)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"45_CR18","doi-asserted-by":"publisher","first-page":"2546","DOI":"10.1109\/TVCG.2012.250","volume":"18","author":"A. Nocaj","year":"2012","unstructured":"Nocaj, A., Brandes, U.: Organizing search results with a reference map. IEEE Trans. Vis. Comput. Graphics\u00a018(12), 2546\u20132555 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"4","key":"45_CR19","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.\u00a017(4), 441\u2013473 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"45_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren Graphen. Acta Mathematica\u00a015(1), 193\u2013220 (1891)","journal-title":"Acta Mathematica"},{"issue":"3","key":"45_CR21","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. Review\u00a024(3), 292\u2013296 (1934)","journal-title":"Geogr. Review"},{"issue":"1","key":"45_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C. Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. J. Combin. Theory, Ser. B\u00a040(1), 9\u201320 (1986)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"6","key":"45_CR23","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1109\/TVCG.2009.171","volume":"15","author":"F.B. Vi\u00e9gas","year":"2009","unstructured":"Vi\u00e9gas, F.B., Wattenberg, M., Feinberg, J.: Participatory visualization with Wordle. IEEE Trans. Vis. Comput. Graphics\u00a015(6), 1137\u20131144 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"3","key":"45_CR24","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. Graphics Forum\u00a030(3), 741\u2013750 (2011)","journal-title":"Comput. Graphics Forum"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:49:58Z","timestamp":1558860598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}