{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:29:46Z","timestamp":1753356586757,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T00:00:00Z","timestamp":1532476800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00454-018-0020-2","type":"journal-article","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T13:31:17Z","timestamp":1532525477000},"page":"562-594","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-4241","authenticated-orcid":false,"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0198-0162","authenticated-orcid":false,"given":"Sebastian","family":"Morr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3471-2706","authenticated-orcid":false,"given":"Christian","family":"Scheffer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Brubach, B.: Improved bound for online square-into-square packing. In: Bampis, E., Svensson, O. (eds.) Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA\u201914). Lecture Notes in Computer Science, vol. 8952, pp. 47\u201358. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-18263-6_5"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo, I., Kampas, F.J., Pint\u00e9r, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786\u2013802 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Fekete, S.P., Lang, R.J.: Circle packing for origami design is hard. In: Wang-Iverson, P., et al. (eds.) Origami\n                    \n                      \n                    \n                    $$^5$$\n                    \n                      \n                        \n                          \n                          5\n                        \n                      \n                    \n                  : Proceedings of the 5th International Conference on Origami in Science, pp. 609\u2013626. Mathematics and Education, AK Peters\/CRC Press, Boca Raton (2011)","DOI":"10.1201\/b10971-52"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Hoffmann, H.F.: Online square-into-square packing. In: Raghavendra, P. et al. (eds.) Proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX-RANDOM\u201913). Lecture Notes in Computer Science, vol. 8096, pp. 126\u2013141. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40328-6_10"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1007\/s00453-016-0114-2","volume":"77","author":"SP Fekete","year":"2017","unstructured":"Fekete, S.P., Hoffmann, H.F.: Online square-into-square packing. Algorithmica 77(3), 867\u2013901 (2017)","journal-title":"Algorithmica"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Morr, S., Scheffer, C.: Split packing: Packing circles into triangles with optimal worst-case density. In: Ellen, F. et al. (eds.) Proceedings of the 15th Algorithms and Data Structures Symposium (WADS\u201917). Lecture Notes in Computer Science, vol. 10389, pp. 373\u2013384. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-62127-2_32"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/0377-2217(94)90410-3","volume":"77","author":"HJ Fraser","year":"1994","unstructured":"Fraser, H.J., George, J.A.: Integrated container loading software for pulp and paper industry. Eur. J. Oper. Res. 77(3), 466\u2013474 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Hifi, M., M\u2019Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. (2009). \n                    https:\/\/doi.org\/10.1155\/2009\/150624","DOI":"10.1155\/2009\/150624"},{"issue":"5","key":"20_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.ipl.2015.12.007","volume":"116","author":"P Hokama","year":"2016","unstructured":"Hokama, P., Miyazawa, F.K., Schouery, R.C.S.: A bounded space algorithm for online circle packing. Inf. Process. Lett. 116(5), 337\u2013342 (2016)","journal-title":"Inf. Process. Lett."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Lang, R.J.: A computational algorithm for origami design. In: Proceedings of the 12th Annual Symposium on Computational Geometry (SoCG\u201996), pp. 98\u2013105 (1996)","DOI":"10.1145\/237218.237249"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"JYT 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. Parallel Distrib. Comput. 10(3), 271\u2013275 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(01)00359-6","volume":"122","author":"M Locatelli","year":"2002","unstructured":"Locatelli, M., Raber, U.: Packing equal circles in a square: a deterministic global optimization approach. Discrete Appl. Math. 122(1), 139\u2013166 (2002)","journal-title":"Discrete Appl. Math."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Miyazawa, F.K., Pedrosa, L.L., Schouery, R.C., Sviridenko, M., Wakabayashi, Y.: Polynomial-time approximation schemes for circle packing problems. In: Shulz, A.S., Wagner, D. (eds.) Proceedings of the 22nd European Symposium on Algorithms (ESA\u201914). Lecture Notes in Computer Science, vol. 8737, pp. 713\u2013724 (2014)","DOI":"10.1007\/978-3-662-44777-2_59"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Moon, J.W., Moser, L.: Some packing and covering theorems. In: Proceedings of the Colloquium Mathematicum, vol. 17, pp. 103\u2013110. Institute of Mathematics, Polish Academy of Sciences (1967)","DOI":"10.4064\/cm-17-1-103-110"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Morr, S.: Split packing: An algorithm for packing circles with optimal worst-case density. In: Klein, P.N. (ed.) Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201917), pp. 99\u2013109 (2017)","DOI":"10.1137\/1.9781611974782.7"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Peikert, R., W\u00fcrtz, D., Monagan, M., de\u00a0Groot, C.: Packing circles in a square: a review and new results. In: Kall, P. (ed.) Proceedings of the 15th IFIP Conference. Lecture Notes in Control and Information Sciences, vol. 180, pp. 45\u201354. Springer, Berlin (1992)","DOI":"10.1007\/BFb0113271"},{"key":"20_CR17","unstructured":"Specht, E.: Packomania (2015). \n                    http:\/\/www.packomania.com\/"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF03167582","volume":"21","author":"K Sugihara","year":"2004","unstructured":"Sugihara, K., Sawai, M., Sano, H., Kim, D.S., Kim, D.: Disk packing for the estimation of the size of a wire bundle. J. Ind. Appl. Math. 21(3), 259\u2013278 (2004)","journal-title":"J. Ind. Appl. Math."},{"key":"20_CR19","volume-title":"New Approaches to Circle Packing in a Square","author":"PG Szab\u00f3","year":"2007","unstructured":"Szab\u00f3, P.G., Mark\u00f3t, M.C., Csendes, T., Specht, E., Casado, L.G., Garc\u00eda, I.: New Approaches to Circle Packing in a Square. Springer, New York (2007)"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/S0377-2217(01)00241-7","volume":"141","author":"H Wang","year":"2002","unstructured":"Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. Eur. J. Oper. Res. 141(2), 440\u2013453 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR21","unstructured":"W\u00fcrtz, D., Monagan, M., Peikert, R.: The history of packing circles in a square. Maple Technical Newsletter, pp. 35\u201342 (1994)"},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02007736","volume":"12","author":"Y Xu","year":"1996","unstructured":"Xu, Y.: On the minimum distance determined by \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   (\n                    \n                      \n                    \n                    $$\\le $$\n                    \n                      \n                        \u2264\n                      \n                    \n                   7) points in an isoscele right triangle. Acta Math. Appl. Sinica (Engl. Ser.) 12(2), 169\u2013175 (1996)","journal-title":"Acta Math. Appl. Sinica (Engl. Ser.)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-018-0020-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-0020-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-0020-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T19:03:54Z","timestamp":1563995034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-018-0020-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,25]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s00454-018-0020-2","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2018,7,25]]},"assertion":[{"value":"2 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}