{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:05:37Z","timestamp":1758873937025},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_8","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"80-89","source":"Crossref","is-referenced-by-count":3,"title":["Boundary Labelling of Optimal Total Leader Length"],"prefix":"10.1007","author":[{"given":"M. A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Potika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P. Agarwal","year":"1998","unstructured":"Agarwal, P., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications\u00a011, 209\u2013218 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-31843-9_7","volume-title":"Graph Drawing","author":"M. Bekos","year":"2005","unstructured":"Bekos, M., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 49\u201359. Springer, Heidelberg (2005)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chazelle, B., 36 co-authors : The computational geometry impact task force report. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, vol.\u00a0223, pp. 407\u2013463. AMS (1999)","DOI":"10.1090\/conm\/223"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th ACM Symp. Comp. Geom (SoCG 1991), pp. 281\u2013288 (1991)","DOI":"10.1145\/109648.109680"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1559\/152304075784313304","volume":"2","author":"E. Imhof","year":"1975","unstructured":"Imhof, E.: Positioning Names on Maps. The American Cartographer\u00a02, 128\u2013144 (1975)","journal-title":"The American Cartographer"},{"key":"8_CR6","unstructured":"Iturriaga, C., Lubiw, A.: NP-hardness of some map labeling problems. Technical Report CS-97-18, University of Waterloo (1997)"},{"key":"8_CR7","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. EATCS Monographs on Theoretical Computer Science, vol.\u00a03. Springer, Heidelberg (1984)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"P.M. Vaidya","year":"1989","unstructured":"Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput.\u00a018, 1201\u20131225 (1989)","journal-title":"SIAM J. Comput."},{"key":"8_CR9","unstructured":"Wolff, A., Strijk, T.: The Map-Labeling Bibliography (1996), \n                    \n                      http:\/\/i11www.ira.uka.de\/map-labeling\/bibliography\/"},{"key":"8_CR10","unstructured":"Wagner, F.: Approximate map labeling is in Omega (n log n). Technical Report B 93-18, Fachbereich Mathematik und Informatik, Freie Universitat Berlin (1993)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Wagner, F., Wolff, A.: Map labeling heuristics: provably good and practically useful. In: Proceedings of the eleventh annual symposium on Computational geometry, pp. 109\u2013118 (1995)","DOI":"10.1145\/220279.220291"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1179\/caj.1972.9.2.99","volume":"9","author":"P. Yoeli","year":"1972","unstructured":"Yoeli, P.: The Logic of Automated Map Lettering. The Cartographic Journal\u00a09, 99\u2013108 (1972)","journal-title":"The Cartographic Journal"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:41:09Z","timestamp":1619505669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11573036_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}