{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:46Z","timestamp":1725516406269},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699002"},{"type":"electronic","value":"9783540699033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69903-3_22","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"234-245","source":"Crossref","is-referenced-by-count":2,"title":["Boundary Labeling with Octilinear Leaders"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"given":"Micheal","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1989","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research\u00a038, 22\u201336 (1989)","journal-title":"Operations Research"},{"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, CRPIT 1960, pp. 15\u201321 (2006)","key":"22_CR2"},{"key":"22_CR3","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":"Graph Drawing","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.) GD 2004. LNCS, vol.\u00a03383, pp. 49\u201359. Springer, New York (2005)"},{"key":"22_CR4","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. Computational Geometry: Theory and Applications\u00a036, 215\u2013236 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","first-page":"243","volume-title":"Proc. 15th Int. Symposium on Graph Drawing (GD 2007)","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 2007). LNCS, vol.\u00a04875, pp. 243\u2013254. Springer, Heidelberg (2007)"},{"unstructured":"Benkert, M., N\u00f6llenburg, M.: Improved algorithms for length-minimal one-sided boundary labeling. In: 23rd European Workshop on Computational Geometry (EWCG 2007), pp. 190\u2013193 (2007)","key":"22_CR6"},{"key":"22_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. de Berg","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)"},{"key":"22_CR8","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. Mathematics of Operations Research\u00a013, 330\u2013348 (1988)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V. Gordon","year":"2002","unstructured":"Gordon, V., Proth, J.-M., Chu, C.: A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research\u00a0139(1), 1\u201325 (2002)","journal-title":"European Journal of Operational Research"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representation of subsets. Journal of the London Mathematical Society\u00a010, 26\u201330 (1935)","journal-title":"Journal of the London Mathematical Society"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/APVIS.2007.329277","volume-title":"Proc. Asia Pacific Symposium on Information Visualisation (APVIS 2007)","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 (APVIS 2007), pp. 65\u201372. IEEE, Los Alamitos (2007)"},{"key":"22_CR12","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 Logistic Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistic Quarterly"},{"key":"22_CR13","doi-asserted-by":"publisher","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.\u00a018, 1201\u20131225 (1989)","journal-title":"SIAM J. Comput."},{"unstructured":"Wolff, A., Strijk, T.: The Map-Labeling Bibliography (1996), \n http:\/\/i11www.ira.uka.de\/map-labeling\/bibliography","key":"22_CR14"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69903-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T06:53:02Z","timestamp":1715237582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69903-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699002","9783540699033"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69903-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}