{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:34:15Z","timestamp":1742394855173},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:38:23Z","timestamp":1330277903000},"page":"241-256","source":"Crossref","is-referenced-by-count":9,"title":["On the Edge Label Placement problem"],"prefix":"10.1007","author":[{"given":"Konstantinos G.","family":"Kakoulis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"20_CR1","unstructured":"Ahn, J. and H. Freeman, A program for automatic name placement. Cartographica, 2l(2&3), Summer & Autumn, 1994."},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/212332.212334","volume":"14","author":"J. Christensen","year":"1995","unstructured":"J. Christensen, J. Marks and S. Shieber, An empirical study of algorithms for Point Feature Label Placement. ACM Trans. on Graphics, 14(3):203\u2013232, July, 1995.","journal-title":"ACM Trans. on Graphics"},{"issue":"5","key":"20_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia R., I. G. Tollis, Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry, Theory and Applications, 4(5), pp. 235\u2013282, 1994.","journal-title":"Computational Geometry, Theory and Applications"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/129617.129620","volume":"35","author":"J. S. Doerschler","year":"1992","unstructured":"Doerschler, J. S. and H. Freeman, A rule based system for dense map name placement. Communications of ACM, 35(1), pp. 68\u201379, January, 1992.","journal-title":"Communications of ACM"},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1559\/152304090784005877","volume":"17","author":"L. R. Ebinger","year":"1990","unstructured":"Ebinger, L. R. and A. M. Goulete, Noninteractive automated names placement for the 1990 decennial census. Cartography and Geographic Information Systems, 17(1), pp. 69\u201378, January, 1990.","journal-title":"Cartography and Geographic Information Systems"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. Forman, F. Wagner, A packing problem with applications to lettering of maps. Proc. of 7-th Annual Symposium on Computational Geometry, pp. 281\u2013288, 1991.","DOI":"10.1145\/109648.109680"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0020-0255(88)90011-4","volume":"45","author":"H. Freeman","year":"1988","unstructured":"Herbert Freeman, An Expert System for the Automatic Placement of Names on a Geographical Map. Information Sciences, 45, pp. 367\u2013378, 1988.","journal-title":"Information Sciences"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1142\/S0218001487000096","volume":"1","author":"H. Freeman","year":"1987","unstructured":"Freeman, H. an J. Ahn, On the problem of placing names in a geographical map. International Journal of Pattern Recognition and Artificial Intelligence, 1(1), pp. 121\u2013140, 1987.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"20_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and company, NY, NY, 1979."},{"issue":"2","key":"20_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1559\/152304075784313304","volume":"2","author":"E. Imhof","year":"1975","unstructured":"Eduard Imhof, Positioning names on maps. The American Cartographer, 2(2), pp. 128\u2013144, 1975.","journal-title":"The American Cartographer"},{"key":"20_CR11","unstructured":"Kato, T. and H. Imai, The NP-completeness of the character placement problem of 2 or 3 degrees of freedom. Record of Joint Conference of Electrical and Electronic Engineers in Kyushu, 1138, 1988. In Japanese."},{"key":"20_CR12","unstructured":"J. Marks, private communication, 1996."},{"key":"20_CR13","unstructured":"J. Marks, S. Shieber, The computational complexity of cartographic label placement. Technical Report 05-91, Harvard University, 1991."},{"issue":"3","key":"20_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1559\/152304089783814034","volume":"16","author":"J. W. Roessel van","year":"1989","unstructured":"J. W. van Roessel, An algorithm for locating candidate labeling boxes within a polygon. The American Cartographer, 16(3), pp. 201\u2013209, 1989.","journal-title":"The American Cartographer"},{"issue":"2","key":"20_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1179\/caj.1972.9.2.99","volume":"9","author":"P. Yoeli","year":"1972","unstructured":"Pinhas Yoeli, The logic of automated map lettering. The Cartographic Journal, 9(2), pp. 99\u2013108, December 1972.","journal-title":"The Cartographic Journal"},{"issue":"5","key":"20_CR16","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1287\/opre.38.5.752","volume":"38","author":"S. Zoraster","year":"1990","unstructured":"S. Zoraster, The solution of large 0\u20131 integer programming problems encountered in automated cartography, Operation Research, 38(5), pp. 752\u2013759, September\u2013October, 1990.","journal-title":"Operation Research"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:38:20Z","timestamp":1619559500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}