{"id":"https://openalex.org/W2785423886","doi":"https://doi.org/10.1007/s00453-019-00578-5","title":"Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials","display_name":"Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials","publication_year":2019,"publication_date":"2019-05-03","ids":{"openalex":"https://openalex.org/W2785423886","doi":"https://doi.org/10.1007/s00453-019-00578-5","mag":"2785423886"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00578-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00578-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00578-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00578-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048942396"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.2,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49697216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"81","issue":"10","first_page":"3865","last_page":"3889"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9560999870300293,"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.9449999928474426,"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.9188490509986877},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8165543079376221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.736331582069397},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7114655375480652},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6600437760353088},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.526475191116333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47555774450302124},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4737447202205658},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.4719502031803131},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4619906544685364},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.44451838731765747},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.4344887137413025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4335811734199524},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.42786240577697754},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4115754961967468},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2200360894203186},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09358161687850952}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9188490509986877},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8165543079376221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.736331582069397},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7114655375480652},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6600437760353088},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.526475191116333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47555774450302124},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4737447202205658},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.4719502031803131},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4619906544685364},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.44451838731765747},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.4344887137413025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4335811734199524},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.42786240577697754},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4115754961967468},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2200360894203186},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09358161687850952},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":15,"locations":[{"id":"doi:10.1007/s00453-019-00578-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00578-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00578-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/b6774cd1-aa6c-4313-82d0-dad9159e8eb0","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/b6774cd1-aa6c-4313-82d0-dad9159e8eb0","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jansen, B M P & Pieterse, A 2018, Optimal data reduction for graph coloring using low-degree polynomials. in 12th International Symposium on Parameterized and Exact Computation, IPEC 2017., 22, Leibniz International Proceedings in Informatics (LIPIcs), vol. 89, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, Vienna, Austria, 6/09/17. https://doi.org/10.4230/LIPIcs.IPEC.2017.22","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/8c4378a8-e82a-4cd5-b015-2d35a861017f","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/8c4378a8-e82a-4cd5-b015-2d35a861017f","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jansen, B M P & Pieterse, A 2019, 'Optimal data reduction for graph coloring using low-degree polynomials', Algorithmica, vol. 81, no. 10, pp. 3865-3889. https://doi.org/10.1007/s00453-019-00578-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1802.02050","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.02050","pdf_url":"https://arxiv.org/pdf/1802.02050","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":"text"},{"id":"pmh:oai:pure.tue.nl:publications/8c4378a8-e82a-4cd5-b015-2d35a861017f","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85065446492&partnerID=8YFLogxK","pdf_url":"https://pure.tue.nl/ws/files/143226932/Jansen_Pieterse2019_Article_OptimalDataReductionForGraphCo.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jansen, B M P & Pieterse, A 2019, 'Optimal data reduction for graph coloring using low-degree polynomials', Algorithmica, vol. 81, no. 10, pp. 3865-3889. https://doi.org/10.1007/s00453-019-00578-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2785423886","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1802.02050","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:899660","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=899660","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:916868","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916868","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:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8550","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.22","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:library.tue.nl:899660","is_oa":false,"landing_page_url":"http://repository.tue.nl/899660","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:916868","is_oa":false,"landing_page_url":"http://repository.tue.nl/916868","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:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/8c4378a8-e82a-4cd5-b015-2d35a861017f","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/8c4378a8-e82a-4cd5-b015-2d35a861017f","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":"Algorithmica, 81(10), 3865 - 3889. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b6774cd1-aa6c-4313-82d0-dad9159e8eb0","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/b6774cd1-aa6c-4313-82d0-dad9159e8eb0","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":"12th International Symposium on Parameterized and Exact Computation, IPEC 2017","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.48550/arxiv.1802.02050","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1802.02050","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"},{"id":"doi:10.4230/lipics.ipec.2017.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2017.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00578-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00578-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00578-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3791497074","display_name":null,"funder_award_id":"Veni grant \u2018Frontiers in Parameterized Preprocessing\u2019","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7003692919","display_name":null,"funder_award_id":"Gravitation grant: \u2018NETWORKS\u2019","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2785423886.pdf","grobid_xml":"https://content.openalex.org/works/W2785423886.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W639947448","https://openalex.org/W1699753700","https://openalex.org/W1779781738","https://openalex.org/W1836455089","https://openalex.org/W1909439116","https://openalex.org/W2034437384","https://openalex.org/W2039100365","https://openalex.org/W2058258808","https://openalex.org/W2077575555","https://openalex.org/W2103715966","https://openalex.org/W2116087731","https://openalex.org/W2253794682","https://openalex.org/W2580171847","https://openalex.org/W2914414140","https://openalex.org/W2936634590","https://openalex.org/W2963326511","https://openalex.org/W2988908508","https://openalex.org/W3098486139"],"related_works":["https://openalex.org/W2595163133","https://openalex.org/W2951838648","https://openalex.org/W2540110070","https://openalex.org/W2798803126","https://openalex.org/W2145388251","https://openalex.org/W1601593591","https://openalex.org/W2962811261","https://openalex.org/W2948443822","https://openalex.org/W2893235782","https://openalex.org/W56839923","https://openalex.org/W2185076815","https://openalex.org/W2134469776","https://openalex.org/W1784081369","https://openalex.org/W2394775205","https://openalex.org/W2963087827","https://openalex.org/W2981749766","https://openalex.org/W2949438963","https://openalex.org/W3098486139","https://openalex.org/W2540665384","https://openalex.org/W3082499076"],"abstract_inverted_index":{"The":[0],"theory":[1],"of":[2,38,45,68,107,119,127,162,193,200],"kernelization":[3],"can":[4,140],"be":[5],"used":[6],"to":[7,20,25,90,123,132],"rigorously":[8],"analyze":[9],"data":[10,59],"reduction":[11,60],"for":[12,61,73,79,116,205,219],"graph":[13,121,136],"coloring":[14,220],"problems.":[15],"Here,":[16],"the":[17,43,104,125,142,147,188,191],"aim":[18],"is":[19,33,87],"reduce":[21],"a":[22,46,66,120,128,160,213],"q-Coloring":[23,74],"input":[24,30],"an":[26,133],"equivalent":[27],"but":[28],"smaller":[29],"whose":[31],"size":[32,44,85,108,163,201],"provably":[34],"bounded":[35],"in":[36],"terms":[37],"structural":[39],"properties,":[40],"such":[41,212],"as":[42],"minimum":[47],"vertex":[48,144],"cover.":[49],"In":[50],"this":[51,114],"paper":[52],"we":[53,64,139],"settle":[54],"two":[55],"open":[56],"problems":[57],"about":[58],"q-Coloring.":[62],"First,":[63],"obtain":[65],"kernel":[67,106,161,199],"bitsize":[69],"$${\\mathcal":[70,109,164,202],"{O}}(k^{q-1}\\log":[71],"{k})$$":[72],"parameterized":[75,156],"by":[76,146,157,190],"Vertex":[77],"Cover":[78],"any":[80,206],"$$q\\ge":[81],"3$$":[82],".":[83,111,168,210],"This":[84],"bound":[86,215],"optimal":[88],"up":[89],"$$k^{o(1)}$$":[91],"factors":[92],"assuming":[93,180],"$$\\mathsf":[94,181],"{NP}":[95,182],"\\not":[96,183],"\\subseteq":[97,184],"\\mathsf":[98,185],"{coNP/poly}$$":[99,186],",":[100,187],"and":[101],"improves":[102],"on":[103],"previous-best":[105],"{O}}(k^q)$$":[110],"We":[112,152],"generalize":[113],"result":[115,171],"deciding":[117,124],"q-colorability":[118],"G,":[122],"existence":[126],"homomorphism":[129],"from":[130],"G":[131],"arbitrary":[134],"fixed":[135],"H.":[137],"Furthermore,":[138],"replace":[141],"parameter":[143,150],"cover":[145],"less":[148],"restrictive":[149],"twin-cover.":[151],"prove":[153],"that":[154,173],"H-Coloring":[155],"Twin-Cover":[158],"has":[159],"{O}}(k^{\\varDelta":[165],"(H)}\\log":[166],"k)$$":[167],"Our":[169],"second":[170],"shows":[172],"3-Coloring":[174],"does":[175],"not":[176],"admit":[177],"non-trivial":[178],"sparsification:":[179],"parameterization":[189],"number":[192],"vertices":[194],"n":[195],"admits":[196],"no":[197],"(generalized)":[198],"{O}}(n^{2-\\varepsilon":[203],"})$$":[204],"$$\\varepsilon":[207],">":[208],"0$$":[209],"Previously,":[211],"lower":[214],"was":[216],"only":[217],"known":[218],"with":[221],"$$q":[222],"\\ge":[223],"4$$":[224],"colors.":[225]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}