{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:35:43Z","timestamp":1768714543162,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-52113-3_21","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"297-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster Winner Determination Algorithms for\u00a0(Colored) Arc Kayles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-856X","authenticated-orcid":false,"given":"Tesshu","family":"Hanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0742-4477","authenticated-orcid":false,"given":"Hironori","family":"Kiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5791-0887","authenticated-orcid":false,"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0845-3947","authenticated-orcid":false,"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5259-7644","authenticated-orcid":false,"given":"Kanae","family":"Yoshiwatari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Albert, M., Nowakowski, R., Wolfe, D.: Lessons in Play: An Introduction to Combinatorial Game Theory (2007)","DOI":"10.1201\/b10691"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1006\/jagm.2002.1215","volume":"43","author":"HL Bodlaender","year":"2002","unstructured":"Bodlaender, H.L., Kratsch, D.: Kayles and nimbers. J. Algorithms 43(1), 106\u2013119 (2002)","journal-title":"J. Algorithms"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2014.09.042","volume":"562","author":"HL Bodlaender","year":"2015","unstructured":"Bodlaender, H.L., Kratsch, D., Timmer, S.T.: Exact algorithms for kayles. Theoret. Comput. Sci. 562, 165\u2013176 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(99)00082-1","volume":"230","author":"DM Breuker","year":"2000","unstructured":"Breuker, D.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Solving 8$$\\times $$8 domineering. Theoret. Comput. Sci. 230(1), 195\u2013206 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.3233\/ICG-2002-25202","volume":"25","author":"N Bullock","year":"2002","unstructured":"Bullock, N.: Domineering: solving large combinatorial search spaces. ICGA J. 25(2), 67\u201384 (2002)","journal-title":"ICGA J."},{"issue":"40\u201342","key":"21_CR6","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1038\/scientificamerican0273-106","volume":"230","author":"M Gardner","year":"1974","unstructured":"Gardner, M.: Mathematical games: cram, crosscram and quadraphage: new games having elusive winning strategies. Sci. Am. 230(2), 106\u2013108 (1974)","journal-title":"Sci. Am."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Hanaka, T., Kiya, H., Ono, H., Yoshiwatari, K.: Winner determination algorithms for graph games with matching structures. Algorithmica (2023)","DOI":"10.1007\/s00453-023-01136-w"},{"key":"21_CR10","first-page":"A86","volume":"16","author":"MA Huggan","year":"2016","unstructured":"Huggan, M.A., Stevens, B.: Polynomial time graph families for arc kayles. Integers 16, A86 (2016)","journal-title":"Integers"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-90048-9_8","volume-title":"Discrete and Computational Geometry, Graphs, and Games","author":"Y Kobayashi","year":"2021","unstructured":"Kobayashi, Y.: On structural parameterizations of node kayles. In: Akiyama, J., Marcelo, R.M., Ruiz, M.-J.P., Uno, Y. (eds.) JCDCGGG 2018. LNCS, vol. 13034, pp. 96\u2013105. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90048-9_8"},{"key":"21_CR12","unstructured":"Lachmann, M., Moore, C., Rapaport, I.: Who wins domineering on rectangular boards? arXiv preprint math\/0006066 (2000)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-54423-1_3","volume-title":"LATIN 2014: Theoretical Informatics","author":"M Lampis","year":"2014","unstructured":"Lampis, M., Mitsou, V.: The computational complexity of the game of set and its theoretical applications. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 24\u201334. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54423-1_3"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-50935-8_12","volume-title":"Computers and Games","author":"JWHM Uiterwijk","year":"2016","unstructured":"Uiterwijk, J.W.H.M.: 11\u00a0$$\\times $$\u00a011 domineering is solved: the first player wins. In: Plaat, A., Kosters, W., van den Herik, J. (eds.) CG 2016. LNCS, vol. 10068, pp. 129\u2013136. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50935-8_12"},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.3233\/ICG-180064","volume":"40","author":"JWHM Uiterwijk","year":"2018","unstructured":"Uiterwijk, J.W.H.M.: Construction and investigation of cram endgame databases. ICGA J. 40(4), 425\u2013437 (2018)","journal-title":"ICGA J."},{"key":"21_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-65883-0_8","volume-title":"ACG 2019","author":"JWHM Uiterwijk","year":"2019","unstructured":"Uiterwijk, J.W.H.M.: Solving cram using combinatorial game theory. In: Cazenave, T., van den Herik, J., Saffidine, A., Wu, I.C. (eds.) ACG 2019. LNCS, vol. 12516, pp. 91\u2013105. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-65883-0_8"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2015.05.017","volume":"592","author":"JWHM Uiterwijk","year":"2015","unstructured":"Uiterwijk, J.W.H.M., Barton, M.: New results for domineering from combinatorial game theory endgame databases. Theoret. Comput. Sci. 592, 72\u201386 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-031-06678-8_37","volume-title":"IWOCA 2022","author":"K Yoshiwatari","year":"2022","unstructured":"Yoshiwatari, K., Kiya, H., Hanaka, T., Ono, H.: Winner determination algorithms for graph games with matching structures. In: Bazgan, C., Fernau, H. (eds.) IWOCA 2022. LNCS, vol. 13270, pp. 509\u2013522. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06678-8_37"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:29Z","timestamp":1711569869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","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":"33","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.11","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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}