{"id":"https://openalex.org/W4410899407","doi":"https://doi.org/10.1007/s00236-025-00492-0","title":"Exact and parameterized algorithms for choosability","display_name":"Exact and parameterized algorithms for choosability","publication_year":2025,"publication_date":"2025-05-30","ids":{"openalex":"https://openalex.org/W4410899407","doi":"https://doi.org/10.1007/s00236-025-00492-0","pmid":"https://pubmed.ncbi.nlm.nih.gov/40453564"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-025-00492-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-025-00492-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00492-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00492-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064783288","display_name":"Ivan Bliznets","orcid":"https://orcid.org/0000-0003-2291-2556"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Ivan Bliznets","raw_affiliation_strings":["Faculty of Science and Engineering, University of Groningen, Nijenborgh 9, Groningen, 9747 AG Groningen Netherlands","Faculty of Science and Engineering, University of Groningen, Nijenborgh 9, Groningen, 9747 AG, Groningen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science and Engineering, University of Groningen, Nijenborgh 9, Groningen, 9747 AG Groningen Netherlands","institution_ids":[]},{"raw_affiliation_string":"Faculty of Science and Engineering, University of Groningen, Nijenborgh 9, Groningen, 9747 AG, Groningen, Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I173063890","display_name":"University of Applied Sciences Utrecht","ror":"https://ror.org/028z9kw20","country_code":"NL","type":"education","lineage":["https://openalex.org/I173063890"]},{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, Utrecht, 3584 CC Utrecht Netherlands","Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, Utrecht, 3584 CC, Utrecht, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, Utrecht, 3584 CC Utrecht Netherlands","institution_ids":[]},{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, Utrecht, 3584 CC, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353","https://openalex.org/I173063890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064783288","https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I169381384","https://openalex.org/I173063890","https://openalex.org/I193662353"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12555505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"62","issue":"2","first_page":"24","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9706000089645386,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9672999978065491,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9158617258071899},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.707694947719574},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6957540512084961},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.626856803894043},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6188931465148926},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.5931824445724487},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5703004598617554},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48603111505508423},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.47146421670913696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4658288359642029},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4453768730163574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4340711832046509},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37833529710769653},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15143567323684692}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9158617258071899},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.707694947719574},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6957540512084961},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.626856803894043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6188931465148926},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.5931824445724487},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5703004598617554},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48603111505508423},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.47146421670913696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4658288359642029},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4453768730163574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4340711832046509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37833529710769653},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15143567323684692},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00236-025-00492-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-025-00492-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00492-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmid:40453564","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/40453564","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta informatica","raw_type":null},{"id":"pmh:oai:pure.rug.nl:openaire/367883b8-ac11-45ca-ac7c-139416a92c64","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/367883b8-ac11-45ca-ac7c-139416a92c64","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bliznets, I & Nederlof, J 2025, 'Exact and parameterized algorithms for choosability', Acta informatica, vol. 62, no. 2, 24. https://doi.org/10.1007/s00236-025-00492-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pubmedcentral.nih.gov:12125139","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/12125139","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC12125139/pdf/236_2025_Article_492.pdf","source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acta Inform","raw_type":"Text"},{"id":"pmh:oai:pure.rug.nl:publications/367883b8-ac11-45ca-ac7c-139416a92c64","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/367883b8-ac11-45ca-ac7c-139416a92c64","pdf_url":"https://research.rug.nl/files/1421146899/s00236-025-00492-0.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bliznets, I & Nederlof, J 2025, 'Exact and parameterized algorithms for choosability', Acta informatica, vol. 62, no. 2, 24. https://doi.org/10.1007/s00236-025-00492-0","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00236-025-00492-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-025-00492-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-025-00492-0.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G2367658155","display_name":"Finding Cracks in the Wall of NP-completeness","funder_award_id":"853234","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G686300172","display_name":null,"funder_award_id":"grant agreement No. 853234","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410899407.pdf","grobid_xml":"https://content.openalex.org/works/W4410899407.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1890319011","https://openalex.org/W1979794044","https://openalex.org/W1995561296","https://openalex.org/W2012996595","https://openalex.org/W2045326192","https://openalex.org/W2059732232","https://openalex.org/W2072414205","https://openalex.org/W2089158353","https://openalex.org/W2103183688","https://openalex.org/W2115859130","https://openalex.org/W2154119795","https://openalex.org/W2527693017","https://openalex.org/W2914414140","https://openalex.org/W2949420075","https://openalex.org/W2951897325","https://openalex.org/W2963927233","https://openalex.org/W2966702489","https://openalex.org/W3123514942","https://openalex.org/W4211121212","https://openalex.org/W4243733834","https://openalex.org/W4396571149"],"related_works":["https://openalex.org/W2886237949","https://openalex.org/W2952288771","https://openalex.org/W4289276807","https://openalex.org/W2168711306","https://openalex.org/W4301321172","https://openalex.org/W2545198300","https://openalex.org/W1667353902","https://openalex.org/W292557428","https://openalex.org/W2289764920","https://openalex.org/W2140699162"],"abstract_inverted_index":{".":[0],"This":[1],"result":[2],"answers":[3],"an":[4],"implicit":[5],"question":[6],"from":[7],"Eppstein":[8],"on":[9,16],"a":[10,27,44,64,67,83,113,118,121],"stackexchange":[11],"thread":[12],"discussing":[13],"upper":[14],"bounds":[15],"the":[17,34,39,48,71,97,108,129],"union":[18],"of":[19,66,120,128],"lists":[20],"assigned":[21],"to":[22,123],"vertices.":[23],"We":[24],"also":[25],"present":[26],"[Formula:":[28,74],"see":[29,75],"text]":[30],"time":[31,60,86],"algorithm":[32],"for":[33,47],"general":[35],"Choosability":[36,81],"problem.":[37],"In":[38],"parameterized":[40,50,62,91,116],"setting,":[41],"we":[42,78,111],"give":[43],"polynomial":[45],"kernel":[46],"problem":[49],"by":[51,63,70,92,99,102,117],"vertex":[52],"cover,":[53],"and":[54,69,104],"algorithms":[55],"that":[56,80],"run":[57],"in":[58,94],"FPT":[59],"when":[61],"size":[65,119],"clique-modulator":[68],"dual":[72],"parameterization":[73,98],"text].":[76],"Additionally,":[77],"show":[79],"admits":[82],"significant":[84],"running":[85],"improvement":[87],"if":[88],"it":[89],"is":[90],"cutwidth":[93],"comparison":[95],"with":[96],"treewidth":[100],"studied":[101],"Marx":[103],"Mitsou":[105],"[ICALP'16].":[106],"On":[107],"negative":[109],"side,":[110],"provide":[112],"lower":[114],"bound":[115],"modulator":[122],"split":[124],"graphs":[125],"under":[126],"assumption":[127],"Exponential":[130],"Time":[131],"Hypothesis.":[132]},"counts_by_year":[],"updated_date":"2026-05-12T08:28:47.272897","created_date":"2025-10-10T00:00:00"}