{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:11:45Z","timestamp":1764587505919},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_9","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"111-122","source":"Crossref","is-referenced-by-count":11,"title":["Combining Traditional Map Labeling with Boundary Labeling"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"44","key":"9_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s004530010075","volume":"29","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint (extended abstract). Algorithmica\u00a029(44), 595\u2013609 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/s00453-009-9283-6","volume":"57","author":"M.A. Bekos","year":"2009","unstructured":"Bekos, M.A., Kaufmann, M., N\u00f6llenburg, M., Symvonis, A.: Boundary Labeling with Octilinear Leaders. Algorithmica\u00a057(3), 436\u2013461 (2009)","journal-title":"Algorithmica"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11944836_10","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"M.A. Bekos","year":"2006","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Multi-Stack Boundary Labeling Problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 81\u201392. Springer, Heidelberg (2006)"},{"key":"9_CR4","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Polygons Labelling of Minimum Leader Length. In: Kazuo, M., Kozo, S., Jiro, T. (eds.) Proc. 5th Asia Pacific Symposium on Information Visualisation (APVIS206). CRPIT, vol.\u00a060, pp. 15\u201321. ACS Inc. (2006)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.comgeo.2006.05.003","volume":"36","author":"M.A. Bekos","year":"2007","unstructured":"Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Computational Geometry: Theory and Applications\u00a036, 215\u2013236 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-77537-9_25","volume-title":"Graph Drawing","author":"M. Benkert","year":"2008","unstructured":"Benkert, M., Haverkort, H., Kroll, M., N\u00f6llenburg, M.: Algorithms for multi-criteria one-sided boundary labeling. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 243\u2013254. Springer, Heidelberg (2008)"},{"key":"9_CR7","unstructured":"Cromley, R.G.: A spatial allocation analysis of the point annotation problem. In: Proc. 2nd International Symposium on Spatial Data Handling (SDH 1986), pp. 38\u201349 (1986)"},{"key":"9_CR8","unstructured":"Edelsbrunner, H.: Dynamic data structures for orthogonal intersection queries. Tech. Rep. F59, Tech. Univ. Graz, Institute f\u00fcr Informationsverarbeitung (1980)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annual ACM Symposium on Computational Geometry, pp. 281\u2013288 (1991)","DOI":"10.1145\/109648.109680"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal Packing and Covering in the Plane are NP-Complete. Information Processing Letters\u00a012(3), 133\u2013137 (1981)","journal-title":"Information Processing Letters"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01758838","volume":"8","author":"D. Gusfield","year":"1992","unstructured":"Gusfield, D., Pitt, L.: A bounded approximation for the minimum cost 2-Sat problem. Algorithmica\u00a08(2), 103\u2013117 (1992)","journal-title":"Algorithmica"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/APVIS.2007.329277","volume-title":"Proc. 6th International Asia-Pacific Symposium on Visualization (APVIS 2007)","author":"H.-J. Kao","year":"2007","unstructured":"Kao, H.-J., Lin, C.-C., Yen, H.-C.: Many-to-one boundary labeling. In: Hong, S.-H., Ma, K.-L. (eds.) Proc. 6th International Asia-Pacific Symposium on Visualization (APVIS 2007), pp. 65\u201372. IEEE, Los Alamitos (2007)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","volume":"13","author":"M. Kreveld van","year":"1999","unstructured":"van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Computational Geomentry: Theory and Applications\u00a013, 21\u201347 (1999)","journal-title":"Computational Geomentry: Theory and Applications"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-56503-5_32","volume-title":"STACS 93","author":"L. Kucera","year":"1993","unstructured":"Kucera, L., Mehlhorn, K., Preis, B., Schwarzenecker, E.: Exact algorithms for a geometric packing problem. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 317\u2013322. Springer, Heidelberg (1993)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/PACIFICVIS.2010.5429592","volume-title":"3rd IEEE Pacific Visualization Symposium (PacificVis 2010)","author":"C.-C. Lin","year":"2010","unstructured":"Lin, C.-C.: Crossing-free many-to-one boundary labeling with hyperleaders. In: 3rd IEEE Pacific Visualization Symposium (PacificVis 2010), pp. 185\u2013192. IEEE Press, Los Alamitos (2010)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/IV.2009.84","volume-title":"13th International Conference on Information Visualisation (IV2009)","author":"C.-C. Lin","year":"2009","unstructured":"Lin, C.-C., Wu, H.-Y., Yen, H.-C.: Boundary labeling in text annotation. In: 13th International Conference on Information Visualisation (IV2009), pp. 110\u2013115. IEEE, Los Alamitos (2009)"},{"key":"9_CR17","doi-asserted-by":"publisher","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. Springer-Verlag New York, Inc., Heidelberg (1984)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Poon, C.K., Zhu, B., Chin, F.: A polynomial time solution for labeling a rectilinear map. In: Proc. 13th Annual ACM Symposium on Comp. Geom (SoCG 1997), pp. 451\u2013453 (1997)","DOI":"10.1145\/262839.263079"},{"key":"9_CR19","unstructured":"Wolff, A., Strijk, T.: The Map-Labeling Bibliography, maintained since (1996), \n                  \n                    http:\/\/i11www.ira.uka.de\/map-labeling\/bibliography"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"16","DOI":"10.3138\/9258-63QL-3988-110H","volume":"23","author":"S. Zoraster","year":"1986","unstructured":"Zoraster, S.: Integer programming applied to the map label placement problem. Cartographica\u00a023(3), 16\u201327 (1986)","journal-title":"Cartographica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:57:06Z","timestamp":1553338626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}