{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:20Z","timestamp":1781031440930,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Google PhD Fellowship 2023"],"award-info":[{"award-number":["Google PhD Fellowship 2023"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Microsoft Research India PhD Award 2025"],"award-info":[{"award-number":["Microsoft Research India PhD Award 2025"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Google India Research Award 2021"],"award-info":[{"award-number":["Google India Research Award 2021"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SERB","award":["Core Research Grant CRG\/2022\/001176"],"award-info":[{"award-number":["Core Research Grant CRG\/2022\/001176"]}]},{"name":"Ittiam Systems","award":["CSR Grant"],"award-info":[{"award-number":["CSR Grant"]}]},{"name":"Walmart","award":["WMGT-23-0001"],"award-info":[{"award-number":["WMGT-23-0001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800826","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1145-1156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4007-4648","authenticated-orcid":false,"given":"Debajyoti","family":"Kar","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bengaluru, Computer Science and Automation, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7505-1687","authenticated-orcid":false,"given":"Arindam","family":"Khan","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bengaluru, Computer Science and Automation, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7814-8775","authenticated-orcid":false,"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[{"name":"Technical University of Munich, School of Computation, Information and Technology, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2025. CutList Optimizer. https:\/\/www.cutlistoptimizer.com\/ Web-based sheet & panel cutting optimisation software"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Amir Abboud and Kevin Lewi. 2013. Exact weight subgraphs and the k-sum conjecture. In ICALP. 1\u201312. https:\/\/doi.org\/10.1007\/978-3-642-39206-1_1 10.1007\/978-3-642-39206-1_1","DOI":"10.1007\/978-3-642-39206-1_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2024.8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326122"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Anna Adamaszek and Andreas Wiese. 2015. A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. In SODA. 1491\u20131505. https:\/\/doi.org\/10.1137\/1.9781611973730.98 10.1137\/1.9781611973730.98","DOI":"10.1137\/1.9781611973730.98"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108122"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3242769"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Nikhil Bansal Alberto Caprara Klaus Jansen Lars Pr\u00e4del and Maxim Sviridenko. 2009. A structural lemma in 2-dimensional packing and its implications on approximability. In ISAAC. 77\u201386. https:\/\/doi.org\/10.1007\/978-3-642-10631-6_10 10.1007\/978-3-642-10631-6_10","DOI":"10.1007\/978-3-642-10631-6_10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Nikhil Bansal and Arindam Khan. 2014. Improved Approximation Algorithm for Two-Dimensional Bin Packing. In SODA. 13\u201325. https:\/\/doi.org\/10.1137\/1.9781611973402.2 10.1137\/1.9781611973402.2","DOI":"10.1137\/1.9781611973402.2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/25.3.353"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2024.26"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.12.001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209062"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00253-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Leah Epstein. 2003. Two dimensional packing: the power of rotation. In MFCS. 398\u2013407. https:\/\/doi.org\/10.1007\/978-3-540-45138-9_34 10.1007\/978-3-540-45138-9_34","DOI":"10.1007\/978-3-540-45138-9_34"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90053-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00410-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-023-01130-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Waldo G\u00e1lvez Fabrizio Grandoni Sandy Heydrich Salvatore Ingala Arindam Khan and Andreas Wiese. 2017. Approximating Geometric Knapsack via L-Packings. In FOCS. 260\u2013271. https:\/\/doi.org\/10.1109\/FOCS.2017.32 10.1109\/FOCS.2017.32","DOI":"10.1109\/FOCS.2017.32"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3473713"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2016.9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SOCG.2021.39"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.38"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.1.94"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2019.53"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Fabrizio Grandoni Tobias M\u00f6mke and Andreas Wiese. 2022. A PTAS for unsplittable flow on a path. In STOC. 289\u2013302. https:\/\/doi.org\/10.1145\/3519935.3519959 10.1145\/3519935.3519959","DOI":"10.1145\/3519935.3519959"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.08.008"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2025.60"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2022.78"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/140952636"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Klaus Jansen and Rob van Stee. 2005. On strip packing With rotations. In STOC. 755\u2013761. https:\/\/doi.org\/10.1145\/1060590.1060702 10.1145\/1060590.1060702","DOI":"10.1145\/1060590.1060702"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Klaus Jansen and Guochuan Zhang. 2004. Maximizing the number of packed rectangles. In SWAT. 362\u2013371. https:\/\/doi.org\/10.1007\/978-3-540-27810-8_31 10.1007\/978-3-540-27810-8_31","DOI":"10.1007\/978-3-540-27810-8_31"},{"key":"e_1_3_2_1_33_1","unstructured":"Klaus Jansen and Guochuan Zhang. 2004. On rectangle packing: maximizing benefits. In SODA. 204\u2013213."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2025.104"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2022.71"},{"key":"e_1_3_2_1_36_1","unstructured":"Debajyoti Kar Arindam Khan and Andreas Wiese. 2026. Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations. arxiv:2603.23970"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3736723"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2021.48"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-023-01116-0"},{"key":"e_1_3_2_1_40_1","volume-title":"Approximation Algorithms for Generalized Multidimensional Knapsack. CoRR, abs\/2102.05854","author":"Khan Arindam","year":"2021","unstructured":"Arindam Khan, Eklavya Sharma, and K. V. N. Sreenivas. 2021. Approximation Algorithms for Generalized Multidimensional Knapsack. CoRR, abs\/2102.05854 (2021), arxiv:2102.05854"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2022.23"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2024.27"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02106-y"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.05.031"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90019-L"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.IPEC.2023.33"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3644390"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","unstructured":"Flavio Keidi Miyazawa and Yoshiko Wakabayashi. 2004. Packing problems with orthogonal rotations. In LATIN. 359\u2013368. https:\/\/doi.org\/10.1007\/978-3-540-24698-5_40 10.1007\/978-3-540-24698-5_40","DOI":"10.1007\/978-3-540-24698-5_40"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2020.86"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","unstructured":"Giorgi Nadiradze and Andreas Wiese. 2016. On approximating strip packing with a better ratio than 3\/2. In SODA. 1491\u20131510. https:\/\/doi.org\/10.1137\/1.9781611974331.ch102 10.1137\/1.9781611974331.ch102","DOI":"10.1137\/1.9781611974331.ch102"},{"key":"e_1_3_2_1_51_1","unstructured":"Devtica s.r.o. 2025. optiCutter \u2013 Cut List Optimizer. https:\/\/www.opticutter.com\/cut-list-optimizer Web-based cutting-stock and sheet & panel optimization software"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255801"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-0114(89)90039-0"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:02:15Z","timestamp":1781028135000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":53,"alternative-id":["10.1145\/3798129.3800826","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800826","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}