{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:01:17Z","timestamp":1740096077833,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642218262"},{"type":"electronic","value":"9783642218279"}],"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-21827-9_25","type":"book-chapter","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T02:34:50Z","timestamp":1309228490000},"page":"246-255","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Algorithms for Two-Dimensional Box Placement Problems"],"prefix":"10.1007","author":[{"given":"Wenbin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee-Chong","family":"Oon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg","year":"2008","unstructured":"Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008), \n                    \n                      http:\/\/www.worldcat.org\/isbn\/3540779736","edition":"3"},{"key":"25_CR2","volume-title":"Segment Trees","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Segment Trees, 3rd edn., ch. 10.3. Springer, Heidelberg (2008)","edition":"3"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Healy, P., Creavin, M., Kuusik, A.: An optimal algorithm for rectangle placement. Operations Research Letters\u00a024(1-2) (February 1999), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/B6V8M-43GHSPF-B\/2\/42b6ea739a362592dccfb090350a5a34","DOI":"10.1016\/S0167-6377(98)00048-0"},{"issue":"5","key":"25_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(84)90058-9","volume":"19","author":"D. Wood","year":"1984","unstructured":"Wood, D.: The contour problem for rectilinear polygons. Information Processing Letters\u00a019(5), 229\u2013236 (1984) http:\/\/dx.doi.org\/10.1016\/0020-0190(84)90058-9","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Modern Approaches in Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21827-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T11:00:12Z","timestamp":1553857212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21827-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218262","9783642218279"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21827-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}