{"id":"https://openalex.org/W2943731653","doi":"https://doi.org/10.1007/978-3-030-24766-9_13","title":"Parameterized Complexity of Conflict-Free Graph Coloring","display_name":"Parameterized Complexity of Conflict-Free Graph Coloring","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2943731653","doi":"https://doi.org/10.1007/978-3-030-24766-9_13","mag":"2943731653"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-24766-9_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-24766-9_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1905.00305","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"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":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Utrecht University, Utrecht, Netherlands","Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, Netherlands","institution_ids":[]},{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudeshna Kolay","raw_affiliation_strings":["Ben Gurion University of Negev, Beersheba, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben Gurion University of Negev, Beersheba, Israel","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.06781167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"35","issue":"3","first_page":"168","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9847000241279602,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9810000061988831,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9019321203231812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8452829718589783},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8431410789489746},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6984710693359375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6144897937774658},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.6086406111717224},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5913932919502258},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.5839952230453491},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5733833312988281},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5407455563545227},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5317695736885071},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4961257874965668},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.49373969435691833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44079411029815674},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4317638874053955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4116055369377136},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17301172018051147},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06740403175354004}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9019321203231812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8452829718589783},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8431410789489746},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6984710693359375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6144897937774658},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.6086406111717224},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5913932919502258},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.5839952230453491},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5733833312988281},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5407455563545227},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5317695736885071},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4961257874965668},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.49373969435691833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44079411029815674},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4317638874053955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4116055369377136},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17301172018051147},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06740403175354004},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":14,"locations":[{"id":"doi:10.1007/978-3-030-24766-9_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-24766-9_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1137/19m1307160","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1307160","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/87d64055-8d09-4808-b09e-47db2cfa906f","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/87d64055-8d09-4808-b09e-47db2cfa906f","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bodlaender, H L, Kolay, S & Pieterse, A 2019, Parameterized complexity of conflict-free graph coloring. in Z Friggstad, M R Salavatipour & J-R Sack (eds), Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11646 LNCS, Springer, Cham, pp. 168-180, 16th International Symposium on Algorithms and Data Structures, WADS 2019, Edmonton, Canada, 5/08/19. https://doi.org/10.1007/978-3-030-24766-9_13","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1905.00305","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.00305","pdf_url":"https://arxiv.org/pdf/1905.00305","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:2943731653","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1905.00305.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:913170","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=913170","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:917013","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=917013","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:913170","is_oa":false,"landing_page_url":"http://repository.tue.nl/913170","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:917013","is_oa":false,"landing_page_url":"http://repository.tue.nl/917013","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/87d64055-8d09-4808-b09e-47db2cfa906f","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/87d64055-8d09-4808-b09e-47db2cfa906f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings, 168 - 180","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/c23baa2f-66d1-4cca-ba52-0e02472a8442","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/c23baa2f-66d1-4cca-ba52-0e02472a8442","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv, 2019:1905.00305v1. Cornell University Library","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/390167","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/390167","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings, 11646 LNCS, 168. Springer","raw_type":"info:eu-repo/semantics/bookpart"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/413526","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/413526","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 35(3), 2003. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1905.00305","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1905.00305","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1905.00305","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.00305","pdf_url":"https://arxiv.org/pdf/1905.00305","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W157196075","https://openalex.org/W1779781738","https://openalex.org/W1826123464","https://openalex.org/W1974867378","https://openalex.org/W1976430052","https://openalex.org/W1984121377","https://openalex.org/W2011039300","https://openalex.org/W2015963099","https://openalex.org/W2033159765","https://openalex.org/W2039100365","https://openalex.org/W2071386577","https://openalex.org/W2097503509","https://openalex.org/W2112505974","https://openalex.org/W2119116325","https://openalex.org/W2128759177","https://openalex.org/W2166566648","https://openalex.org/W2568185146","https://openalex.org/W2800485060","https://openalex.org/W2902851628","https://openalex.org/W2914414140","https://openalex.org/W2942681663","https://openalex.org/W2963300845","https://openalex.org/W2963798801","https://openalex.org/W3005839441","https://openalex.org/W6679886561"],"related_works":["https://openalex.org/W3116354270","https://openalex.org/W3122973673","https://openalex.org/W2962857662","https://openalex.org/W2963907277","https://openalex.org/W2915468158","https://openalex.org/W3139078859","https://openalex.org/W2904185472","https://openalex.org/W3126980955","https://openalex.org/W2338323869","https://openalex.org/W2809500103","https://openalex.org/W2218773766","https://openalex.org/W3165316009","https://openalex.org/W3159723557","https://openalex.org/W3033103597","https://openalex.org/W2911783023","https://openalex.org/W3196040394","https://openalex.org/W2197961740","https://openalex.org/W3123623337","https://openalex.org/W1799262171","https://openalex.org/W2893188841"],"abstract_inverted_index":{"Given":[0],"a":[1,4,12,29,58,60,80,87,90,176,191],"graph":[2,85],"G,":[3,226],"q-open":[5],"neighborhood":[6,52,62],"conflict-free":[7,63],"coloring":[8,14,59,64],"or":[9,65,89],"q-ONCF-coloring":[10,88],"is":[11,28,34],"vertex":[13,23,30,148,177,198,240,245,269,285,303],"$$c:V(G)":[15],"\\rightarrow":[16],"\\{1,2,\\ldots":[17],",q\\}$$":[18],"such":[19,57],"that":[20,33,155],"for":[21,79,112,194,278],"each":[22],"$$v":[24],"\\in":[25],"V(G)$$":[26],"there":[27],"in":[31,43,98],"N(v)":[32,48],"uniquely":[35],"colored":[36],"from":[37],"the":[38,41,50,73,99,121,131,141,151,173,186,202,216,253,291],"rest":[39],"of":[40,77,103,144,175,219,255],"vertices":[42],"N(v).":[44],"When":[45],"we":[46,55,71,105,139,189,289],"replace":[47],"by":[49,117,172,197],"closed":[51],"N[v],":[53],"then":[54],"call":[56],"q-closed":[61],"simply":[66],"q-CNCF-coloring.":[67,91],"In":[68],"this":[69],"paper,":[70],"study":[72,94,106,140,203],"NP-hard":[74],"decision":[75],"questions":[76],"whether":[78],"constant":[81],"q":[82],"an":[83,259],"input":[84],"has":[86],"We":[92,119,153,200,274],"will":[93],"these":[95,113],"two":[96],"problems":[97],"parameterized":[100,116,171,196],"setting.":[101],"First":[102],"all,":[104],"running":[107,132],"time":[108,133],"bounds":[109,129,229,277,294],"on":[110,130,230,262,295],"FPT-algorithms":[111],"problems,":[114,146],"when":[115,170],"treewidth.":[118,307],"improve":[120],"existing":[122],"upper":[123,260,293],"bounds,":[124],"and":[125,136,161,211,224,248,306],"also":[126],"provide":[127,275,290],"lower":[128],"under":[134],"ETH":[135],"SETH.":[137],"Secondly,":[138],"kernelization":[142],"complexity":[143],"both":[145,156],"using":[147],"cover":[149,178,241,270,286],"as":[150],"parameter.":[152],"show":[154],"$$(q":[157,162],"\\ge":[158,163],"2)$$":[159],"-ONCF-coloring":[160],"3)$$":[164],"-CNCF-coloring":[165],"cannot":[166],"have":[167],"polynomial":[168,192],"kernels":[169],"size":[174,247,271,305],"unless":[179],"$$\\mathsf":[180],"{NP":[181],"\\subseteq":[182],"coNP/poly}$$":[183],".":[184],"On":[185],"other":[187],"hand,":[188],"obtain":[190],"kernel":[193],"2-CNCF-coloring":[195],"cover.":[199],"conclude":[201],"with":[204,233,265,281,298],"some":[205],"combinatorial":[206],"results.":[207],"Denote":[208],"$$\\chi":[209,212,231,263,279,296],"_{ON}(G)$$":[210,264,280,297],"_{CN}(G)$$":[213,232],"to":[214,222,235,267,283,300],"be":[215],"minimum":[217,239,243,268,284,301],"number":[218],"colors":[220],"required":[221],"ONCF-color":[223],"CNCF-color":[225],"respectively.":[227],"Upper":[228],"respect":[234,266,282,299],"structural":[236],"parameters":[237],"like":[238],"size,":[242],"feedback":[244,302],"set":[246,304],"treewidth":[249],"are":[250],"known.":[251,273],"To":[252],"best":[254],"our":[256],"knowledge":[257],"only":[258],"bound":[261],"was":[272],"tight":[276],"size.":[287],"Also,":[288],"first":[292]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-21T07:57:09.225873","created_date":"2025-10-10T00:00:00"}