{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:10:29Z","timestamp":1781799029094,"version":"3.54.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,5]],"date-time":"2009-02-05T00:00:00Z","timestamp":1233792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s00453-009-9283-6","type":"journal-article","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T14:12:20Z","timestamp":1233756740000},"page":"436-461","source":"Crossref","is-referenced-by-count":38,"title":["Boundary Labeling with Octilinear Leaders"],"prefix":"10.1007","volume":"57","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,2,5]]},"reference":[{"key":"9283_CR1","first-page":"1259","volume":"3","author":"G. Adel\u2019son-Vel\u2019skii","year":"1962","unstructured":"Adel\u2019son-Vel\u2019skii, G., Landis, E.: An algorithm for the organization of information. Sov. Math. Dokl. 3, 1259\u20131263 (1962)","journal-title":"Sov. Math. Dokl."},{"key":"9283_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, New York (1999)"},{"key":"9283_CR3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary b-trees: data structures and maintenance algorithms. Acta Inf. 1, 290\u2013306 (1972)","journal-title":"Acta Inf."},{"key":"9283_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/11944836_10","volume-title":"Proc. 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS2006)","author":"M.A. Bekos","year":"2006","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Multi-stack boundary labeling problems. In: Proc. 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS2006). Lecture Notes in Computer Science, vol.\u00a04337, pp.\u00a081\u201392. Springer, Berlin (2006)"},{"key":"9283_CR5","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. Asia Pacific Symposium on Information Visualisation (APVIS2006), CRPIT 60, pp.\u00a015\u201321 (2006)"},{"key":"9283_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-540-31843-9_7","volume-title":"Proc. 12th Int. Symposium on Graph Drawing (GD\u201904)","author":"M.A. Bekos","year":"2005","unstructured":"Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. In: Pach, J. (ed.) Proc. 12th Int. Symposium on Graph Drawing (GD\u201904). Lecture Notes in Computer Science, vol.\u00a03383, pp.\u00a049\u201359. Springer, New York (2005)"},{"key":"9283_CR7","doi-asserted-by":"crossref","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. Comput. Geom., Theory Appl. 36, 215\u2013236 (2007)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9283_CR8","series-title":"Lecture Notes in Computer Science","first-page":"243","volume-title":"Proc. 15th Int. Symposium on Graph Drawing (GD\u201907)","author":"M. Benkert","year":"2007","unstructured":"Benkert, M., Haverkort, H., Kroll, M., N\u00f6llenburg, M.: Algorithms for multi-criteria one-sided boundary labeling. In: Proc. 15th Int. Symposium on Graph Drawing (GD\u201907). Lecture Notes in Computer Science, vol.\u00a04875, pp.\u00a0243\u2013254. Springer, Berlin (2007)"},{"key":"9283_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2000)"},{"key":"9283_CR10","doi-asserted-by":"crossref","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annu. ACM Sympos. Comput. Geom., pp.\u00a0281\u2013288 (1991)","DOI":"10.1145\/109648.109680"},{"key":"9283_CR11","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"M. Garey","year":"1988","unstructured":"Garey, M., Tarjan, R., Wilfong, G.: One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13, 330\u2013348 (1988)","journal-title":"Math. Oper. Res."},{"key":"9283_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/APVIS.2007.329277","volume-title":"Proc. Asia Pacific Symposium on Information Visualisation (APVIS2007)","author":"H.-J. Kao","year":"2007","unstructured":"Kao, H.-J., Lin, C.-C., Yen, H.-C.: Many-to-one boundary labeling. In: Proc. Asia Pacific Symposium on Information Visualisation (APVIS2007), pp.\u00a065\u201372. IEEE, New York (2007)"},{"key":"9283_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs: Methods and Models","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. Lecture Notes in Computer Science, vol.\u00a02025. Springer, Berlin (2001)"},{"key":"9283_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"9283_CR15","doi-asserted-by":"crossref","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. 18, 1201\u20131225 (1989)","journal-title":"SIAM J. Comput."},{"key":"9283_CR16","doi-asserted-by":"crossref","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. Comput. Geom., Theory Appl. 13, 21\u201347 (1999)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9283_CR17","unstructured":"Wolff, A., Strijk, T.: The map-labeling bibliography, maintained since 1996. Online: http:\/\/i11www.iti.uni-karlsruhe.de\/~awolff\/map-labeling\/bibliography\/"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9283-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9283-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9283-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:03Z","timestamp":1559123103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9283-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9283"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9283-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,5]]}}}