{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:01:41Z","timestamp":1710248501982},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T00:00:00Z","timestamp":1189468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00224-007-9039-0","type":"journal-article","created":{"date-parts":[[2007,9,10]],"date-time":"2007-09-10T18:51:34Z","timestamp":1189450294000},"page":"38-55","source":"Crossref","is-referenced-by-count":17,"title":["Online Removable Square Packing"],"prefix":"10.1007","volume":"43","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,11]]},"reference":[{"key":"9039_CR1","unstructured":"Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: SODA, pp. 189\u2013196 (2004)"},{"key":"9039_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A. Caprara","year":"2004","unstructured":"Caprara, A., Monaci, M.: On the two-dimensional knapsack problem. Oper. Res. Lett. 32, 5\u201314 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9039_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-44867-5_5","volume-title":"Proc. WEA","author":"M. Caramia","year":"2003","unstructured":"Caramia, M., Giordan, S., Iovanella, A.: An on-line algorithm for the rectangle packing problem with rejection. In: Proc. WEA. Lecture Notes in Computer Science, vol. 2647, pp. 59\u201369. Springer, Berlin (2003)"},{"key":"9039_CR4","unstructured":"Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: SODA, pp. 179\u2013188 (2004)"},{"key":"9039_CR5","doi-asserted-by":"crossref","unstructured":"Epstein, L., van Stee, R.: Online square and cube packing. Acta Inform. 595\u2013606 (2005)","DOI":"10.1007\/s00236-005-0169-z"},{"key":"9039_CR6","doi-asserted-by":"crossref","unstructured":"Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: Packing weighted rectangles into a square. In: MFCS, pp. 352\u2013363 (2005)","DOI":"10.1007\/11549345_31"},{"key":"9039_CR7","first-page":"223","volume":"19","author":"C.E. Ferreira","year":"1999","unstructured":"Ferreira, C.E., Miyazawa, E.K., Wakabayashi, Y.: Packing squares into squares. Pesquisa Oper. 19, 223\u2013237 (1999)","journal-title":"Pesquisa Oper."},{"key":"9039_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Proc. ICALP","author":"K. Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Proc. ICALP. Lecture Notes in Computer Science, vol. 2380, pp. 293\u2013305. Springer, Berlin (2002)"},{"key":"9039_CR9","unstructured":"Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: SODA, pp. 197\u2013206 (2004)"},{"key":"9039_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1004953109743","volume":"67","author":"J. Januszewski","year":"1997","unstructured":"Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geom. Dedic. 67, 285\u2013293 (1997)","journal-title":"Geom. Dedic."},{"issue":"3","key":"9039_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00453-004-1102-5","volume":"40","author":"Y. Kohayakawa","year":"2004","unstructured":"Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensional cube packing. Algorithmica 40(3), 173\u2013187 (2004)","journal-title":"Algorithmica"},{"key":"9039_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J.\u00a0Parallel Distrib. Comput. 10, 271\u2013275 (1990)","journal-title":"J.\u00a0Parallel Distrib. Comput."},{"key":"9039_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A. Meir","year":"1968","unstructured":"Meir, A., Moser, L.: On packing of squares and cubes. J. Comb. Theory 5, 126\u2013134 (1968)","journal-title":"J. Comb. Theory"},{"key":"9039_CR14","doi-asserted-by":"crossref","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: ICALP pp.\u00a01111\u20131122 (2004)","DOI":"10.1007\/978-3-540-27836-8_92"},{"key":"9039_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica 36, 261\u2013293 (2003)","journal-title":"Algorithmica"},{"key":"9039_CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.-C. Yao","year":"1980","unstructured":"Yao, A.C.-C.: New algorithms for bin packing. J. ACM 27, 207\u2013227 (1980)","journal-title":"J. ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9039-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9039-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9039-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:34Z","timestamp":1558698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9039-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,11]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9039"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9039-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,11]]}}}