{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:23:37Z","timestamp":1783103017248,"version":"3.54.6"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032304902","type":"print"},{"value":"9783032304919","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T00:00:00Z","timestamp":1783123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T00:00:00Z","timestamp":1783123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-30491-9_9","type":"book-chapter","created":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:09:43Z","timestamp":1783102183000},"page":"130-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Beyond Endpoint Quality: A Phase-Aware Analysis of\u00a0Search Dynamics in\u00a0Triangle Reassembly"],"prefix":"10.1007","author":[{"given":"Damir","family":"Hasanspahi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adis","family":"Alihod\u017ei\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damir","family":"Hasi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,4]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.cie.2014.12.006","volume":"81","author":"Y Abdelsadek","year":"2015","unstructured":"Abdelsadek, Y., Herrmann, F., Kacem, I., Otjacques, B.: Branch-and-bound algorithm for the maximum triangle packing problem. Comput. Industr. Eng. 81, 147\u2013157 (2015). https:\/\/doi.org\/10.1016\/j.cie.2014.12.006","journal-title":"Comput. Industr. Eng."},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Abrahamsen, M., Miltzow, T., Seiferth, N.: Framework for $$\\exists \\mathbb{R}$$-completeness of two-dimensional packing problems. TheoretiCS 3, 11 (2024). https:\/\/doi.org\/10.46298\/theoretics.24.11","DOI":"10.46298\/theoretics.24.11"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Adamaszek, A., Kociumaka, T., Pilipczuk, M., Pilipczuk, M.: Hardness of approximation for strip packing. ACM Trans. Comput. Theor. 9(3), 14:1\u201314:7 (2017). https:\/\/doi.org\/10.1145\/3092026","DOI":"10.1145\/3092026"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Alihod\u017ei\u0107, A.: Exploring Computational Geometry: Theory and Python Implementations. Springer, Cham (2026). https:\/\/doi.org\/10.1007\/978-3-032-06393-9","DOI":"10.1007\/978-3-032-06393-9"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Alihod\u017eic, A., Hasanspahic, D., Tuba, E., Hasic, D.: Triangle packing strategies within a rectangle. In: Proceedings of the IEEE International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA), Boracay, Philippines (2026, to appear). https:\/\/doi.org\/10.1109\/ACDSA67686.2026.11468118, https:\/\/ieeexplore.ieee.org\/document\/11468118","DOI":"10.1109\/ACDSA67686.2026.11468118"},{"key":"9_CR6","unstructured":"Allen, S.R., Iacono, J.: Packing identical simple polygons is NP-hard (2012). https:\/\/arxiv.org\/abs\/1209.5307"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"JA Bennell","year":"2008","unstructured":"Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184(2), 397\u2013415 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.11.038","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.cor.2006.02.026","volume":"35","author":"JA Bennell","year":"2008","unstructured":"Bennell, J.A., Song, X.: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35(1), 267\u2013281 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.02.026","journal-title":"Comput. Oper. Res."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","volume":"179","author":"EK Burke","year":"2007","unstructured":"Burke, E.K., Hellier, R.S.R., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1), 27\u201349 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.03.011","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(02)00274-0","volume":"84","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Rizzi, R.: Packing triangles in bounded degree graphs. Inf. Process. Lett. 84(4), 175\u2013180 (2002). https:\/\/doi.org\/10.1016\/S0020-0190(02)00274-0","journal-title":"Inf. Process. Lett."},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Chen, C.B., He, D.H.: A heuristic method for solving triangle packing problem. J. Zhejiang Univ. Sci. A 6(6), 565\u2013570 (2005). https:\/\/doi.org\/10.1631\/jzus.2005.A0565","DOI":"10.1631\/jzus.2005.A0565"},{"key":"9_CR13","unstructured":"Chou, A.: NP-hard triangle packing problems. Research Science Institute manuscript, January 2016. https:\/\/math.mit.edu\/research\/highschool\/rsi\/documents\/2015Chou.pdf"},{"issue":"3\u20134","key":"9_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Mathematica Academiae Scientiarum Hungaricae 14(3\u20134), 423\u2013439 (1963). https:\/\/doi.org\/10.1007\/BF01895727","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"9_CR15","unstructured":"Delaunay, B.: Sur la sph\u00e8re vide. A la m\u00e9moire de Georges Vorono\u00ef. Bulletin de l\u2019Acad\u00e9mie des Sciences de l\u2019URSS. Classe des sciences math\u00e9matiques et naturelles (6), 793\u2013800 (1934)"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981). https:\/\/doi.org\/10.1016\/0020-0190(81)90111-3","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00100-4","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0012-365X(98)00183-6","volume":"195","author":"PE Haxell","year":"1999","unstructured":"Haxell, P.E.: Packing and covering triangles in graphs. Discret. Math. 195, 251\u2013254 (1999). https:\/\/doi.org\/10.1016\/S0012-365X(98)00183-6","journal-title":"Discret. Math."},{"key":"9_CR19","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Tech. Rep.\u00a0TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, October 2005. https:\/\/abc.erciyes.edu.tr\/pub\/tr06_2005.pdf"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007). https:\/\/doi.org\/10.1007\/s10898-007-9149-x","journal-title":"J. Global Optim."},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 240\u2013245 (1978). https:\/\/doi.org\/10.1145\/800133.804353","DOI":"10.1145\/800133.804353"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","volume":"282","author":"AAS Leao","year":"2020","unstructured":"Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A., Alvarez-Vald\u00e9s, R.: Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282(3), 803\u2013822 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.04.045","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241\u2013252 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(02)00123-6","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, International Series in Operations Research and Management Science, vol.\u00a057, pp. 320\u2013353. Springer, Boston, MA (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11","DOI":"10.1007\/0-306-48056-5_11"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications, 2nd edn. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol.\u00a0146, pp. 363\u2013397. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_12","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Luo, C., Su, Z., L\u00fc, Z.: A general heuristic approach for maximum polygon packing. In: 40th International Symposium on Computational Geometry, SoCG 2024. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0293, pp. 86:1\u201386:9 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2024.86","DOI":"10.4230\/LIPIcs.SoCG.2024.86"},{"issue":"8","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/j.disc.2007.07.100","volume":"308","author":"G Mani\u0107","year":"2008","unstructured":"Mani\u0107, G., Wakabayashi, Y.: Packing triangles in low degree graphs and indifference graphs. Discret. Math. 308(8), 1455\u20131471 (2008). https:\/\/doi.org\/10.1016\/j.disc.2007.07.100","journal-title":"Discret. Math."},{"issue":"11","key":"9_CR28","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput. Oper. Res."},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Zhang, K., Yu, W., Manhein, M., Waggenspack, W., Li, X.: 3D fragment reassembly using integrated template guidance and fracture-region matching. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV), pp. 2138\u20132146 (2015). https:\/\/doi.org\/10.1109\/ICCV.2015.247","DOI":"10.1109\/ICCV.2015.247"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30491-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:09:46Z","timestamp":1783102186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30491-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,4]]},"ISBN":["9783032304902","9783032304919"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30491-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,4]]},"assertion":[{"value":"4 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}