{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:39Z","timestamp":1771036359802,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00453-015-0028-4","type":"journal-article","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T10:06:43Z","timestamp":1437386803000},"page":"225-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Multi-sided Boundary Labeling"],"prefix":"10.1007","volume":"76","author":[{"given":"Philipp","family":"Kindermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Niedermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"PK Agarwal","year":"1999","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912\u2013953 (1999)","journal-title":"SIAM J. Comput."},{"key":"28_CR2","unstructured":"Bastert, O., Fekete, S.P.: Geometrische Verdrahtungsprobleme. Technical Report 96\u2013247, Universit\u00e4t zu K\u00f6ln (1996)"},{"key":"28_CR3","first-page":"244","volume-title":"Proceedings of 21st International Symposium on Graph Drawing (GD\u201913), Volume 8242 of Lecture Notes in Computer Science","author":"MA Bekos","year":"2013","unstructured":"Bekos, M.A., Cornelsen, S., Fink, M., Hong, S., Kaufmann, M., N\u00f6llenburg, M., Rutter, I., Symvonis, A.: Many-to-one boundary labeling with backbones. In: Wismath, S., Wolff, A. (eds.) Proceedings of 21st International Symposium on Graph Drawing (GD\u201913), Volume 8242 of Lecture Notes in Computer Science, pp. 244\u2013255. Springer, Berlin (2013)"},{"issue":"3","key":"28_CR4","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/s00453-009-9283-6","volume":"57","author":"MA Bekos","year":"2010","unstructured":"Bekos, M.A., Kaufmann, M., N\u00f6llenburg, M., Symvonis, A.: Boundary labeling with octilinear leaders. Algorithmica 57(3), 436\u2013461 (2010)","journal-title":"Algorithmica"},{"issue":"6","key":"28_CR5","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1093\/comjnl\/bxp087","volume":"53","author":"MA Bekos","year":"2010","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Area-feature boundary labeling. Comput. J. 53(6), 827\u2013841 (2010)","journal-title":"Comput. J."},{"issue":"3","key":"28_CR6","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.comgeo.2006.05.003","volume":"36","author":"MA 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(3), 215\u2013236 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"28_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.7155\/jgaa.00189","volume":"13","author":"M Benkert","year":"2009","unstructured":"Benkert, M., Haverkort, H.J., Kroll, M., N\u00f6llenburg, M.: Algorithms for multi-criteria boundary labeling. J. Graph Algorithms Appl. 13(3), 289\u2013317 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"28_CR8","first-page":"376","volume-title":"Proceedings of the 21st International Symposium on Graph Drawing (GD\u201913) volume 8242 of Lecture Notes in Computer Science","author":"TM Chan","year":"2013","unstructured":"Chan, T.M., Hoffmann, H.-F., Kiazyk, S., Lubiw, A.: Minimum length embedding of planar graphs at fixed vertex locations. In: Wismath, S.K., Wolff, A. (eds.) Proceedings of the 21st International Symposium on Graph Drawing (GD\u201913) volume 8242 of Lecture Notes in Computer Science, pp. 376\u2013387. Springer, Berlin (2013)"},{"key":"28_CR9","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. 223, pp. 407\u2013463. American Mathematical Society, Providence (1999)","DOI":"10.1090\/conm\/223"},{"issue":"12","key":"28_CR10","doi-asserted-by":"crossref","first-page":"2583","DOI":"10.1109\/TVCG.2012.193","volume":"18","author":"M Fink","year":"2012","unstructured":"Fink, M., Haunert, J.-H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for labeling focus regions. IEEE Trans. Visual. Comput. Graphics 18(12), 2583\u20132592 (2012)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"key":"28_CR11","unstructured":"Freeman, H., Marrinan, S., Chitalia, H.: Automated labeling of soil survey maps. In: Proceedings of ASPRS-ACSM Annual Convention, Baltimore, Vol. 1, pp. 51\u201359 (1996)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Gemsa, A., Haunert, J.-H., N\u00f6llenburg, M.: Boundary-labeling algorithms for panorama images. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advanced Geographic Information Systems (ACM-GIS\u201911), pp. 289\u2013298 (2011)","DOI":"10.1145\/2093973.2094012"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified positions. Am. Math. Mon. 98, 165\u2013166 (1991)","journal-title":"Am. Math. Mon."},{"issue":"6","key":"28_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-geodesic embedding of planar graphs. In: Eppstein, D., Gansner, E.R. (eds) Proceedings of the 17th International Symposium Graph Drawing (GD\u201909), Volume 5849 of Lecture Notes in Computer Science, pp. 207\u2013218. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11805-0_21"},{"issue":"1","key":"28_CR16","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.7.1.84","volume":"7","author":"TM Liebling","year":"1995","unstructured":"Liebling, T.M., Margot, F., M\u00fcller, D., Prodon, A., Stauffer, L.: Disjoint paths in the plane. ORSA J. Comput. 7(1), 84\u201388 (1995)","journal-title":"ORSA J. Comput."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Lin, C.-C.: Crossing-free many-to-one boundary labeling with hyperleaders. In: Proceedings of the IEEE Pacific Visualization Symposium(PacificVis\u201910), pp. 185\u2013192 (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429592"},{"issue":"3","key":"28_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.7155\/jgaa.00169","volume":"12","author":"C-C Lin","year":"2008","unstructured":"Lin, C.-C., Kao, H.-J., Yen, H.-C.: Many-to-one boundary labeling. J. Graph Algorithms Appl. 12(3), 319\u2013356 (2008)","journal-title":"J. Graph Algorithms Appl."},{"key":"28_CR19","volume-title":"The Computer in Contemporary Cartography","author":"JL Morrison","year":"1980","unstructured":"Morrison, J.L.: Computer technology and cartographic change. In: Taylor, D. (ed.) The Computer in Contemporary Cartography. Johns Hopkins University Press, Baltimore (1980)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M., Polishchuk, V., Sysikaski, M.: Dynamic one-sided boundary labeling. In: Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM-GIS\u201910), pp. 310\u2013319 (2010)","DOI":"10.1145\/1869790.1869834"},{"issue":"2","key":"28_CR21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0196-6774(86)90006-4","volume":"7","author":"R Raghavan","year":"1986","unstructured":"Raghavan, R., Cohoon, J., Sahni, S.: Single bend wiring. J. Algorithms 7(2), 232\u2013257 (1986)","journal-title":"J. Algorithms"},{"key":"28_CR22","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."},{"issue":"4","key":"28_CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1559\/152304097782439259","volume":"24","author":"S Zoraster","year":"1997","unstructured":"Zoraster, S.: Practical results using simulated annealing for point feature label placement. Cartogr. GIS 24(4), 228\u2013238 (1997)","journal-title":"Cartogr. GIS"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0028-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0028-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0028-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T08:56:59Z","timestamp":1566982619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0028-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0028-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,21]]}}}