{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:22Z","timestamp":1725761122232},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_22","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"244-255","source":"Crossref","is-referenced-by-count":3,"title":["Many-to-One Boundary Labeling with Backbones"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","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. CoRR (2013), arXiv:1308.6801"},{"issue":"3","key":"22_CR2","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\u00a036(3), 215\u2013236 (2007)","journal-title":"Computational Geometry"},{"issue":"7","key":"22_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0167-6377(91)90041-M","volume":"10","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Tamir, A.: Improved complexity bounds for location problems on the real line. Operations Research Letters\u00a010(7), 395\u2013402 (1991)","journal-title":"Operations Research Letters"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-03456-5_20","volume-title":"Efficient Algorithms","author":"M. Kaufmann","year":"2009","unstructured":"Kaufmann, M.: On map labeling with leaders. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 290\u2013304. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"22_CR5","doi-asserted-by":"publisher","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. Naval Research Logistics Quarterly\u00a02(1-2), 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Lin, C.C.: Crossing-free many-to-one boundary labeling with hyperleaders. In: Proc. IEEE Pacific Visualization Symp. (PacificVis 2010), pp. 185\u2013192. IEEE (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429592"},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","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. Journal of Graph Algorithms and Applications\u00a012(3), 319\u2013356 (2008)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S. Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Trans. Computers\u00a039(1), 124\u2013127 (1990)","journal-title":"IEEE Trans. Computers"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:55:29Z","timestamp":1558749329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}