{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:52:00Z","timestamp":1742917920595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_16","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"210-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds for\u00a0the\u00a0Binary Paint Shop Problem"],"prefix":"10.1007","author":[{"given":"J.","family":"Han\u010dl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Kabela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Opler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Sosnovec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"\u0160\u00e1mal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Valtr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","volume":"63","author":"N Alon","year":"1987","unstructured":"Alon, N.: Splitting necklaces. Adv. in Math. 63(3), 247\u2013253 (1987)","journal-title":"Adv. in Math."},{"key":"16_CR2","unstructured":"Alon, N., Elboim, D., Pach, J., Tardos, G.: Random necklaces require fewer cuts. arXiv:2112.14488"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Andres, S.D.: Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem. Discrete. Appl. Math. 303, 4\u20137 (2021). Technical report FernUniversitat in Hagen 2019: https:\/\/www.fernuni-hagen.de\/MATHEMATIK\/DMO\/pubs\/feu-dmo064-19.pdf","DOI":"10.1016\/j.dam.2020.05.028"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jda.2010.12.003","volume":"9","author":"SD Andres","year":"2011","unstructured":"Andres, S.D., Hochst\u00e4ttler, W.: Some heuristics for the binary paint shop problem and their expected number of colour changes. J. Discret. Algorithms 9(2), 203\u2013211 (2011)","journal-title":"J. Discret. Algorithms"},{"issue":"9","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/j.dam.2005.05.033","volume":"154","author":"P Bonsma","year":"2006","unstructured":"Bonsma, P., Epping, T., Hochst\u00e4ttler, W.: Complexity results on restricted instances of a paint shop problem for words. Discret. Appl. Math. 154(9), 1335\u20131343 (2006)","journal-title":"Discret. Appl. Math."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Epping, T., Hochst\u00e4ttler, W., Oertel, P.: Complexity results on a paint shop problem. Discrete Appl. Math. 136, 2\u20133 (2004), 217\u2013226. The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2001)","DOI":"10.1016\/S0166-218X(03)00442-6"},{"issue":"11","key":"16_CR7","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1016\/j.cor.2012.01.014","volume":"39","author":"F Meunier","year":"2012","unstructured":"Meunier, F., Neveu, B.: Computing solutions of the paintshop-necklace problem. Comput. Oper. Res. 39(11), 2666\u20132678 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.dam.2008.06.017","volume":"157","author":"F Meunier","year":"2009","unstructured":"Meunier, F., Seb\u0151, A.: Paintshop, odd cycles and necklace splitting. Discret. Appl. Math. 157(4), 780\u2013793 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02189092","volume":"8","author":"ER Scheinerman","year":"1988","unstructured":"Scheinerman, E.R.: Random interval graphs. Combinatorica 8(4), 357\u2013371 (1988)","journal-title":"Combinatorica"},{"key":"16_CR10","unstructured":"\u0160\u00e1mal, R., Han\u010dl, J., Kabela, A., Opler, M., Sosnovec, J., Valtr, P.: The binary paint shop problem. In: Slides from workshop MCW in Prague, 30 July 2019. https:\/\/kam.mff.cuni.cz\/workshops\/mcw\/slides\/samal.pdf"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:05:08Z","timestamp":1702026308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}