{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:22Z","timestamp":1725663622628},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:14:53Z","timestamp":1330236893000},"page":"317-322","source":"Crossref","is-referenced-by-count":5,"title":["Exact algorithms for a geometric packing problem (extended abstract)"],"prefix":"10.1007","author":[{"given":"L.","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Preis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Schwarzenecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/00029890.1963.11992093","volume":"70","author":"A. S. Besicovitch","year":"1963","unstructured":"A.S. Besicovitch. The Kakeya problem. The American Mathematical Monthly, 70:697\u2013706, 1963.","journal-title":"The American Mathematical Monthly"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"M. Formann and F. Wagner. A packing problem with applications to lettering of maps. Technical Report B 91-04, Institut f\u00fcr Informatik, FU Berlin, 1991.","DOI":"10.1145\/109648.109680"},{"key":"32_CR3","unstructured":"T. Lengauer and K. Mehlhorn. Four results on the complexity of VLSI computations. In Advances in Computing Research, Vol 2, pages 1\u201322. JAI Press Inc., 1984."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"R. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 3, 1979.","DOI":"10.1137\/0136016"},{"key":"32_CR5","unstructured":"J. Matou\u0161ek. Personal communication. 1992."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:19Z","timestamp":1605629059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}