{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:36:10Z","timestamp":1742931370204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"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_8","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"111-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact and\u00a0Parameterized Algorithms for\u00a0Choosability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2291-2556","authenticated-orcid":false,"given":"Ivan","family":"Bliznets","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1848-0076","authenticated-orcid":false,"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"8_CR1","first-page":"1","volume":"187","author":"N Alon","year":"1993","unstructured":"Alon, N.: Restricted colorings of graphs. Surv. Comb. 187, 1\u201333 (1993)","journal-title":"Surv. Comb."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12, 125\u2013134 (1992). https:\/\/doi.org\/10.1007\/BF01204715","journal-title":"Combinatorica"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 67\u201374. ACM (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"8_CR5","unstructured":"Bliznets, I., Hecher, M.: Private communication (2023)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/jgt.22013","volume":"84","author":"M Bonamy","year":"2017","unstructured":"Bonamy, M., Kang, R.J.: List coloring with a bounded palette. J. Graph Theory 84(1), 93\u2013103 (2017)","journal-title":"J. Graph Theory"},{"key":"8_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, vol. 5. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"8_CR8","series-title":"Electronic Library of Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2006","unstructured":"Diestel, R.: Graph Theory. Electronic Library of Mathematics, Springer, Heidelberg (2006)"},{"key":"8_CR9","unstructured":"Erdos, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 26, pp. 125\u2013157 (1979)"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., et al.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2), 143\u2013153 (2011)","journal-title":"Inf. Comput."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). Publisher Copyright: Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi 2019","DOI":"10.1017\/9781107415157"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-03816-7_33","volume-title":"Mathematical Foundations of Computer Science 2009","author":"PA Golovach","year":"2009","unstructured":"Golovach, P.A., Heggernes, P.: Choosability of $$P_5$$-free graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 382\u2013391. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_33"},{"key":"8_CR13","unstructured":"Golovach, P.A., Heggernes, P.: Choosability of $$P_5$$-free graphs. Bull. Syktyvkar Univ. Ser. 1. Math. Mech. Comput. Sci. (11), 126\u2013139 (2010)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Heggernes, P., van\u2019t Hof, P., Paulusma, D.: Choosability on $$H$$-free graphs. Inf. Process. Lett. 113(4), 107\u2013110 (2013)","DOI":"10.1016\/j.ipl.2012.12.003"},{"issue":"1\u20133","key":"8_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(95)00104-5","volume":"159","author":"S Gutner","year":"1996","unstructured":"Gutner, S.: The complexity of planar graph choosability. Discrete Math. 159(1\u20133), 119\u2013130 (1996)","journal-title":"Discrete Math."},{"issue":"8","key":"8_CR16","doi-asserted-by":"publisher","first-page":"2260","DOI":"10.1016\/j.disc.2008.04.061","volume":"309","author":"S Gutner","year":"2009","unstructured":"Gutner, S., Tarsi, M.: Some results on (a: b)-choosability. Discrete Math. 309(8), 2260\u20132270 (2009)","journal-title":"Discrete Math."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.tcs.2019.08.006","volume":"795","author":"BM Jansen","year":"2019","unstructured":"Jansen, B.M., Nederlof, J.: Computing the chromatic number using graph decompositions via matrix rank. Theor. Comput. Sci. 795, 520\u2013539 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR18","unstructured":"Kowalik, L., Socala, A.: Tight lower bounds for list edge coloring. In: Eppstein, D. (ed.) 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. LIPIcs, Malm\u00f6, Sweden, 18\u201320 June 2018, vol. 101, pp. 28:1\u201328:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/jgt.20073","volume":"49","author":"D Kr\u00e1l\u2019","year":"2005","unstructured":"Kr\u00e1l\u2019, D., Sgall, J.: Coloring graphs from lists with bounded size of their union. J. Graph Theory 49(3), 177\u2013186 (2005)","journal-title":"J. Graph Theory"},{"key":"8_CR20","unstructured":"Marx, D., Mitsou, V.: Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth (2016)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.jctb.2018.06.007","volume":"134","author":"M Molloy","year":"2019","unstructured":"Molloy, M.: The list chromatic number of graphs with small clique number. J. Comb. Theory Ser. B 134, 264\u2013284 (2019)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/jgt.21819","volume":"79","author":"JA Noel","year":"2015","unstructured":"Noel, J.A., Reed, B.A., Wu, H.: A proof of a conjecture of Ohba. J. Graph Theory 79(2), 86\u2013102 (2015)","journal-title":"J. Graph Theory"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00493-005-0010-x","volume":"25","author":"B Reed","year":"2004","unstructured":"Reed, B., Sudakov, B.: List colouring when the chromatic number is close to the order of the graph. Combinatorica 25(1), 117\u2013123 (2004)","journal-title":"Combinatorica"},{"issue":"3","key":"8_CR24","first-page":"10","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret. Analiz 29(3), 10 (1976)","journal-title":"Diskret. Analiz"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:03:36Z","timestamp":1711569816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}