{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:33:28Z","timestamp":1725798808346},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_8","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T10:43:15Z","timestamp":1408185795000},"page":"87-99","source":"Crossref","is-referenced-by-count":1,"title":["Improved Approximation Algorithms for Box Contact Representations"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Thomas C.","family":"van Dijk","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/978-3-642-54423-1_45","volume-title":"LATIN 2014: Theoretical Informatics","author":"L. Barth","year":"2014","unstructured":"Barth, L., Fabrikant, S.I., Kobourov, S.G., 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.) LATIN 2014. LNCS, vol.\u00a08392, pp. 514\u2013525. Springer, Heidelberg (2014)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-07959-2_21","volume-title":"Experimental Algorithms","author":"L. Barth","year":"2014","unstructured":"Barth, L., Kobourov, S.G., Pupyrev, S.: Experimental comparison of semantic word clouds. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol.\u00a08504, pp. 247\u2013258. Springer, Heidelberg (2014)"},{"key":"8_CR3","unstructured":"Bekos, M., van Dijk, T., Fink, M., Kindermann, P., Kobourov, S.G., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved approximation algorithms for box contact representations. Arxiv report (2014) arxiv.org\/abs\/1403.4861"},{"issue":"6","key":"8_CR4","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.\u00a040(6), 1587\u20131622 (2011)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","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"},{"key":"8_CR6","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: 11th ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 213\u2013222. SIAM (2000)"},{"issue":"4","key":"8_CR7","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.\u00a0100(4), 162\u2013166 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"8_CR8","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.\u00a030(6), 42\u201353 (2010)","journal-title":"IEEE Comput. Graph. Appl."},{"key":"8_CR9","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":"8_CR10","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."},{"issue":"1","key":"8_CR11","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.\u00a022(1), 457\u2013479 (2004)","journal-title":"J. Artif. Int. Res."},{"key":"8_CR12","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":"8_CR13","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.\u00a036(3), 416\u2013431 (2011)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput.\u00a016(6), 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR15","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."},{"issue":"1-3","key":"8_CR16","doi-asserted-by":"publisher","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":"1","key":"8_CR17","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.\u00a08(1), 25\u201342 (2002)","journal-title":"J. Nat. Lang. Eng."},{"key":"8_CR18","doi-asserted-by":"crossref","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. L. Math. Soc.\u00a039, 12 (1964)","journal-title":"J. L. Math. Soc."},{"issue":"3","key":"8_CR19","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.\u00a028(3), 255\u2013267 (1979)","journal-title":"Discrete Math."},{"issue":"4","key":"8_CR20","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":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1111\/j.1467-8659.2012.03107.x","volume":"31","author":"F.V. 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\u00a031(3), 1145\u20131153 (2012)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"8_CR22","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":"6","key":"8_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. Graph.\u00a015(6), 1137\u20131144 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"8_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. Graph. Forum\u00a030(3), 741\u2013750 (2011)","journal-title":"Comput. Graph. Forum"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:26:01Z","timestamp":1558974361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}