{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:11Z","timestamp":1780783151247,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_21","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:52Z","timestamp":1780780492000},"page":"296-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Removable Online Knapsack: Exploiting Recourse and\u00a0Bounded Item Sizes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6864-8960","authenticated-orcid":false,"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5076-1583","authenticated-orcid":false,"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6220-3722","authenticated-orcid":false,"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9540-2334","authenticated-orcid":false,"given":"Panagiotis","family":"Patsilinakos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"21_CR1","unstructured":"ALPS: https:\/\/algorithms-with-predictions.github.io\/"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling ad campaigns: online algorithms with cancellations. In: EC, pp. 61\u201370. ACM (2009)","DOI":"10.1145\/1566374.1566383"},{"key":"21_CR3","unstructured":"B\u00f6ckenhauer, H., Burjons, E., Hromkovic, J., Lotze, H., Rossmanith, P.: Online simple knapsack with reservation costs. In: STACS, pp. 16:1\u201316:18. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"21_CR4","unstructured":"B\u00f6ckenhauer, H., Frei, F., Rossmanith, P.: Removable online knapsack and advice. In: STACS, pp. 18:1\u201318:17. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.dam.2025.08.011","volume":"378","author":"H B\u00f6ckenhauer","year":"2026","unstructured":"B\u00f6ckenhauer, H., Hromkovic, J., Komm, D., Rossmanith, P., Stocker, M.: A survey of online knapsack problems. Discret. Appl. Math. 378, 492\u2013507 (2026)","journal-title":"Discret. Appl. Math."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H., Klasing, R., M\u00f6mke, T., Rossmanith, P., Stocker, M., Wehner, D.: Online knapsack with removal and recourse. In: IWOCA, LNCS, vol. 13889, pp. 123\u2013135. Springer (2023)","DOI":"10.1007\/978-3-031-34347-6_11"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"103697","DOI":"10.1016\/j.jcss.2025.103697","volume":"155","author":"H B\u00f6ckenhauer","year":"2026","unstructured":"B\u00f6ckenhauer, H., Klasing, R., M\u00f6mke, T., Rossmanith, P., Stocker, M., Wehner, D.: Online knapsack with removal and recourse. J. Comput. Syst. Sci. 155, 103697 (2026)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2014.01.027","volume":"527","author":"H B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H., Komm, D., Kr\u00e1lovic, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theor. Comput. Sci. 527, 61\u201372 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","unstructured":"Burjons, E., Gehnen, M., Lotze, H., Mock, D., Rossmanith, P.: The online simple knapsack problem with reservation and removability. In: MFCS, pp. 29:1\u201329:12. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00224-014-9566-4","volume":"58","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Jez, L., Sgall, J.: Online knapsack revisited. Theor. Comput. Syst. 58(1), 153\u2013190 (2016)","journal-title":"Theor. Comput. Syst."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Pagourtzis, A.: Removable online knapsack with bounded size items. In: SOFSEM, LNCS, vol. 14519, pp. 283\u2013296. Springer (2024)","DOI":"10.1007\/978-3-031-52113-3_20"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s00453-013-9822-z","volume":"70","author":"X Han","year":"2014","unstructured":"Han, X., Kawase, Y., Makino, K.: Online unweighted knapsack problem with removal cost. Algorithmica 70(1), 76\u201391 (2014)","journal-title":"Algorithmica"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.tcs.2014.10.017","volume":"562","author":"X Han","year":"2015","unstructured":"Han, X., Kawase, Y., Makino, K.: Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562, 395\u2013405 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR14","unstructured":"Han, X., Kawase, Y., Makino, K., Yokomaku, H.: Online knapsack problems with a resource buffer. In: ISAAC, LIPIcs, vol.\u00a0149, pp. 28:1\u201328:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"44\u201346","key":"21_CR15","doi-asserted-by":"publisher","first-page":"3956","DOI":"10.1016\/j.tcs.2010.08.009","volume":"411","author":"X Han","year":"2010","unstructured":"Han, X., Makino, K.: Online removable knapsack with limited cuts. Theor. Comput. Sci. 411(44\u201346), 3956\u20133964 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Automata, Languages and Programming","author":"K Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 293\u2013305. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_26"},{"issue":"22","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1016\/j.ipl.2010.08.013","volume":"110","author":"K Iwama","year":"2010","unstructured":"Iwama, K., Zhang, G.: Online knapsack with resource augmentation. Inf. Process. Lett. 110(22), 1016\u20131020 (2010)","journal-title":"Inf. Process. Lett."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01585758","volume":"68","author":"A Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Program. 68, 73\u2013104 (1995)","journal-title":"Math. Program."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Vassilvitskii, S.: Algorithms with Predictions, p. 646\u2013662. Cambridge University Press (2021)","DOI":"10.1017\/9781108637435.037"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-92185-1_63","volume-title":"Internet and Network Economics","author":"Y Zhou","year":"2008","unstructured":"Zhou, Y., Chakrabarty, D., Lukose, R.: Budget constrained bidding in keyword auctions and online knapsack problems. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 566\u2013576. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_63"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:54Z","timestamp":1780780494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}