{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:15:21Z","timestamp":1760440521764},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_10","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"81-92","source":"Crossref","is-referenced-by-count":12,"title":["Multi-stack Boundary Labeling Problems"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/11573036_8","volume-title":"Advances in Informatics","author":"M.A. Bekos","year":"2005","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Boundary labelling of optimal total leader length. In: Bozanis, P., Houstis, E.N. (eds.) PCI 2005. LNCS, vol.\u00a03746, pp. 80\u201389. Springer, Heidelberg (2005)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Multi-stack boundary labeling problems, Technical report (2006), Available online: http:\/\/www.math.ntua.gr\/aarg\/","DOI":"10.1007\/11944836_10"},{"key":"10_CR3","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Polygon labelling of minimim leader length. In: Asia Pacific Symposium on Information Visualisation (APVIS 2006), CRPIT 60, pp. 15\u201321 (2006)"},{"key":"10_CR4","unstructured":"Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications, Available online: http:\/\/www.sciencedirect.com\/"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Heidelberg (2005)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11618058_45","volume-title":"Graph Drawing","author":"M.A. Bekos","year":"2006","unstructured":"Bekos, M.A., Symvonis, A.: Bler: A boundary labeller for technical drawings. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 503\u2013504. Springer, Heidelberg (2006)"},{"key":"10_CR7","unstructured":"Eades, P., Lin, T., Lin, X.: Minimum size h-v drawings. In: Advanced Visual Interfaces (Proceedings of AVI 1992). World Scientific Series in Computer Science, vol.\u00a036, pp. 386\u2013394 (1992)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annuual ACM Symposium on Computational Geometry (SoCG 1991), pp. 281\u2013288 (1991)","DOI":"10.1145\/109648.109680"},{"key":"10_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"10_CR10","unstructured":"SmartDraw-7. Product web site: http:\/\/www.smartdraw.com"},{"issue":"2-3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L. Stockmeyer","year":"1983","unstructured":"Stockmeyer, L.: Optimal orientations of cells in slicing floorplan designs. Information and Control\u00a057(2-3), 91\u2013101 (1983)","journal-title":"Information and Control"},{"key":"10_CR12","unstructured":"Wolff, A., Strijk, T.: The Map-Labeling Bibliography (1996), http:\/\/i11www.ira.uka.de\/map-labeling\/bibliography"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:52:41Z","timestamp":1619509961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11944836_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}