{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:52:45Z","timestamp":1725598365287},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"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-22616-8_30","type":"book-chapter","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T21:25:42Z","timestamp":1311974742000},"page":"387-398","source":"Crossref","is-referenced-by-count":2,"title":["One-and-a-Half-Side Boundary Labeling"],"prefix":"10.1007","author":[{"given":"Chun-Cheng","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeo","family":"Takahashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsiang-Yun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/s00453-009-9283-6","volume":"57","author":"M. Bekos","year":"2010","unstructured":"Bekos, M., Kaufmann, M., N\u00f6llenburg, M., Symvonis, A.: Boundary labeling with octilinear leaders. Algorithmica\u00a057(3), 436\u2013461 (2010)","journal-title":"Algorithmica"},{"issue":"6","key":"30_CR2","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1093\/comjnl\/bxp087","volume":"53","author":"M. Bekos","year":"2009","unstructured":"Bekos, M., Kaufmann, M., Potina, K., Symvonis, A.: Area-feature boundary labeling. The Computer Journal\u00a053(6), 827\u2013841 (2009)","journal-title":"The Computer Journal"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.comgeo.2006.05.003","volume":"36","author":"M. Bekos","year":"2006","unstructured":"Bekos, M., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications\u00a036(3), 215\u2013236 (2006)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"30_CR4","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":"30_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/109648.109680","volume-title":"Proc. of the 7th Annual ACM Symposium on Computational Geometry (SoCG 1991)","author":"M. Formann","year":"1991","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. of the 7th Annual ACM Symposium on Computational Geometry (SoCG 1991), pp. 281\u2013288. ACM Press, New York (1991)"},{"key":"30_CR6","doi-asserted-by":"publisher","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.\u00a013, 330\u2013348 (1988)","journal-title":"Math. Oper. Res."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/PACIFICVIS.2010.5429592","volume-title":"Proc. of 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: Proc. of 3rd IEEE Pacific Visualization Symposium (PacificVis 2010), pp. 185\u2013192. IEEE Press, Los Alamitos (2010)"},{"issue":"3","key":"30_CR8","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"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/IV.2009.84","volume-title":"Proc. of 13th International Conference on Information Visualisation (IV 2009)","author":"C.C. Lin","year":"2009","unstructured":"Lin, C.C., Wu, H.Y., Yen, H.C.: Boundary labeling in text annotation. In: Proc. of 13th International Conference on Information Visualisation (IV 2009), pp. 110\u2013115. IEEE CS Press, Los Alamitos (2009)"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0020-0190(94)90001-9","volume":"52","author":"F. Wagner","year":"1994","unstructured":"Wagner, F.: Approximate map labeling is in \u03a9(n logn). Information Processing Letters\u00a052(3), 161\u2013165 (1994)","journal-title":"Information Processing Letters"},{"key":"30_CR11","first-page":"109","volume-title":"Proc. of the 11th Annual ACM Symposium on Computational Geometry (SoCG 1995)","author":"F. Wagner","year":"1995","unstructured":"Wagner, F., Wolff, A.: Map labeling heuristics: Provably good and practically useful. In: Proc. of the 11th Annual ACM Symposium on Computational Geometry (SoCG 1995), pp. 109\u2013118. ACM Press, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T09:09:17Z","timestamp":1686215357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}