{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:13:46Z","timestamp":1743016426415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319894409"},{"type":"electronic","value":"9783319894416"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89441-6_12","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"147-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online Packing of Rectangular Items into Square Bins"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Januszewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"key":"12_CR1","unstructured":"Brubach, B.: Improved online square-into-square packing. arxiv.org\/pdf\/1401.5583.pdf"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-18263-6_5","volume-title":"Approximation and Online Algorithms","author":"B Brubach","year":"2015","unstructured":"Brubach, B.: Improved bound for online square-into-square packing. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 47\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18263-6_5"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-17514-5_21","volume-title":"Algorithms and Computation","author":"Y Zhang","year":"2010","unstructured":"Zhang, Y., Chen, J., Chin, F.Y.L., Han, X., Ting, H.-F., Tsin, Y.H.: Improved online algorithms for 1-space bounded 2-dimensional bin packing. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 242\u2013253. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17514-5_21"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2014.02.045","volume":"554","author":"FYL Chin","year":"2014","unstructured":"Chin, F.Y.L., Han, X., Poon, C.K., Ting, H.-F., Tsin, Y.H., Ye, D., Zhang, Y.: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554, 135\u2013149 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Ting, H.-F., Zhang, Y.: 1-space bounded algorithms for 2-dimensional bin packing. In: Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 321\u2013330 (2009)","DOI":"10.1007\/978-3-642-10631-6_34"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1142\/S0129054110007611","volume":"21","author":"FYL Chin","year":"2010","unstructured":"Chin, F.Y.L., Ting, H.-F., Zhang, Y.: One-space bounded algorithms for two-dimensional bin packing. Int. J. Found. Comput. Sci. 21(6), 875\u2013891 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0097539705446895","volume":"35","author":"L Epstein","year":"2005","unstructured":"Epstein, L., van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35(2), 431\u2013448 (2005)","journal-title":"SIAM J. Comput."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-40328-6_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"SP Fekete","year":"2013","unstructured":"Fekete, S.P., Hoffmann, H.-F.: Online square-into-square packing. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2013. LNCS, vol. 8096, pp. 126\u2013141. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40328-6_10"},{"issue":"2","key":"12_CR9","first-page":"189","volume":"17","author":"P Grzegorek","year":"2014","unstructured":"Grzegorek, P., Januszewski, J.: Online algorithms for $$3$$-space bounded $$2$$-dimensional bin packing and square packing. Rom. J. Inf. Sci. Technol. 17(2), 189\u2013202 (2014)","journal-title":"Rom. J. Inf. Sci. Technol."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1016\/j.ipl.2015.06.001","volume":"115","author":"P Grzegorek","year":"2015","unstructured":"Grzegorek, P., Januszewski, J.: A note on one-space bounded square packing. Inf. Process. Lett. 115, 872\u2013876 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00224-007-9039-0","volume":"43","author":"X Han","year":"2008","unstructured":"Han, X., Iwama, K., Zhang, G.: Online removable square packing. Theory Comput. Syst. 43(1), 38\u201355 (2008)","journal-title":"Theory Comput. Syst."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1005263703808","volume":"8","author":"J Januszewski","year":"2000","unstructured":"Januszewski, J.: Packing rectangles into the unit square. Geom. Dedicata 8, 13\u201318 (2000)","journal-title":"Geom. Dedicata"},{"key":"12_CR13","doi-asserted-by":"publisher","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. Dedicata 67, 285\u2013293 (1997)","journal-title":"Geom. Dedicata"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0129054116500076","volume":"27","author":"J Januszewski","year":"2016","unstructured":"Januszewski, J., Zielonka, \u0141.: Improved online algorithms for 2-space bounded 2-dimensional bin packing. Int. J. Found. Comput. Sci. 27(4), 407\u2013429 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272\u2013314 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1004280725513","volume":"34","author":"M Lassak","year":"1997","unstructured":"Lassak, M.: On-line potato-sack algorithm efficient for packing into small boxes. Periodica Math. Hung. 34, 105\u2013110 (1997)","journal-title":"Periodica Math. Hung."},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. ACM 32, 562\u2013572 (1985)","journal-title":"J. ACM"},{"key":"12_CR18","unstructured":"Moser, L.: Poorly formulated unsolved problems of combinatorial geometry. Mimeographed (1966)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4064\/cm-17-1-103-110","volume":"17","author":"J Moon","year":"1967","unstructured":"Moon, J., Moser, L.: Some packing and covering theorems. Colloq. Math. 17, 103\u2013110 (1967)","journal-title":"Colloq. Math."},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/TST.2015.7128937","volume":"20","author":"X Zhao","year":"2015","unstructured":"Zhao, X., Shen, H.: On-line algorithms for 2-space bounded cube and hypercube packing. Tsinghua Sci. Technol. 20(3), 255\u2013263 (2015)","journal-title":"Tsinghua Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89441-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:20:07Z","timestamp":1710246007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}