{"id":"https://openalex.org/W3085636930","doi":"https://doi.org/10.1145/3612938","title":"Sparsification Lower Bounds for List <i>H</i> -Coloring","display_name":"Sparsification Lower Bounds for List <i>H</i> -Coloring","publication_year":2023,"publication_date":"2023-09-15","ids":{"openalex":"https://openalex.org/W3085636930","doi":"https://doi.org/10.1145/3612938","mag":"3085636930"},"language":"en","primary_location":{"id":"doi:10.1145/3612938","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3612938","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3612938","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3612938","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107271836","display_name":"Hubie Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hubie Chen","raw_affiliation_strings":["King\u2019s College London, United Kingdom","King's College London, United Kingdom"],"raw_orcid":"https://orcid.org/0009-0005-4025-8086","affiliations":[{"raw_affiliation_string":"King\u2019s College London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King's College London, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","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":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-8204-1268","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076603106","display_name":"Karolina Okrasa","orcid":"https://orcid.org/0000-0003-1414-3507"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Karolina Okrasa","raw_affiliation_strings":["University of Warsaw, Institute of Informatics, Poland and Warsaw University of Technology, Poland"],"raw_orcid":"https://orcid.org/0000-0003-1414-3507","affiliations":[{"raw_affiliation_string":"University of Warsaw, Institute of Informatics, Poland and Warsaw University of Technology, Poland","institution_ids":["https://openalex.org/I108403487","https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3721-6721","affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047941027","display_name":"Pawe\u0142 Rz\u0105\u017cewski","orcid":"https://orcid.org/0000-0001-7696-3848"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Rz\u0105\u017cewski","raw_affiliation_strings":["Warsaw University of Technology, Poland and University of Warsaw, Institute of Informatics, Poland"],"raw_orcid":"https://orcid.org/0000-0001-7696-3848","affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, Poland and University of Warsaw, Institute of Informatics, Poland","institution_ids":["https://openalex.org/I108403487","https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1442,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.41617279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"3-4","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9638000130653381,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9103000164031982,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8514364957809448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6820498704910278},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.6167568564414978},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5008344650268555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4973278343677521},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.4717465341091156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4701317250728607},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.44412940740585327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4200756251811981}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8514364957809448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6820498704910278},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.6167568564414978},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5008344650268555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4973278343677521},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.4717465341091156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4701317250728607},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.44412940740585327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4200756251811981}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3612938","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3612938","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3612938","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chen, H, Jansen, B M P, Okrasa, K, Pieterse, A & Rz\u0105\u017cewski, P 2023, 'Sparsification Lower Bounds for List H-Coloring', ACM Transactions on Computation Theory, vol. 15, no. 3-4, 8. https://doi.org/10.1145/3612938","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0","is_oa":true,"landing_page_url":"https://research.tue.nl/files/315044951/3612938.pdf","pdf_url":"https://pure.tue.nl/ws/files/315044951/3612938.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":"Chen, H, Jansen, B M P, Okrasa, K, Pieterse, A & Rz\u0105\u017cewski, P 2023, 'Sparsification Lower Bounds for List H-Coloring', ACM Transactions on Computation Theory, vol. 15, no. 3-4, 8. https://doi.org/10.1145/3612938","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3612938","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3612938","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3612938","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1003009945","display_name":null,"funder_award_id":"KR 4286/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7561358084","display_name":null,"funder_award_id":"2018/31/D/ST6/00062","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3085636930.pdf","grobid_xml":"https://content.openalex.org/works/W3085636930.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1148390943","https://openalex.org/W1548527711","https://openalex.org/W1560586330","https://openalex.org/W1572041907","https://openalex.org/W1909439116","https://openalex.org/W1977197609","https://openalex.org/W1984264511","https://openalex.org/W1988205260","https://openalex.org/W1989905036","https://openalex.org/W2018547288","https://openalex.org/W2024156610","https://openalex.org/W2028556486","https://openalex.org/W2033470072","https://openalex.org/W2034437384","https://openalex.org/W2038074073","https://openalex.org/W2039100365","https://openalex.org/W2047828174","https://openalex.org/W2068654529","https://openalex.org/W2069703826","https://openalex.org/W2077575555","https://openalex.org/W2083748805","https://openalex.org/W2117427564","https://openalex.org/W2128959968","https://openalex.org/W2132911512","https://openalex.org/W2495593369","https://openalex.org/W2580171847","https://openalex.org/W2659011796","https://openalex.org/W2789288165","https://openalex.org/W2909144890","https://openalex.org/W2942681663","https://openalex.org/W2949385111","https://openalex.org/W2949653700","https://openalex.org/W2951672858","https://openalex.org/W2963267430","https://openalex.org/W2963300845","https://openalex.org/W2972759174","https://openalex.org/W2996959612","https://openalex.org/W3036120879","https://openalex.org/W3082547133","https://openalex.org/W3116354270","https://openalex.org/W4211121212","https://openalex.org/W4247305611","https://openalex.org/W4322202843"],"related_works":["https://openalex.org/W3020640542","https://openalex.org/W4245720151","https://openalex.org/W2292973071","https://openalex.org/W2476602023","https://openalex.org/W2381408042","https://openalex.org/W3037240142","https://openalex.org/W4301454895","https://openalex.org/W4318567365","https://openalex.org/W4392245071","https://openalex.org/W112717413"],"abstract_inverted_index":{"We":[0,86,127],"investigate":[1,87],"the":[2,7,23,88,92,95,166],"List":[3,69,138],"H":[4,26,55,70,76,131,139,170],"-Coloring":[5,71,140],"problem,":[6],"generalization":[8],"of":[9,91,97,112,165,168],"graph":[10,17,25,81],"coloring":[11],"that":[12,31,68,129],"asks":[13],"whether":[14],"an":[15,101,109],"input":[16],"G":[18,38],"admits":[19],"a":[20,43,78,134,145,163],"homomorphism":[21],"to":[22,42,108],"undirected":[24],"(possibly":[27],"with":[28,162],"loops),":[29],"such":[30,144],"each":[32],"vertex":[33,44],"v":[34,50],"\u2208":[35],"V":[36,53],"(":[37,49,54,118],")":[39,51,121],"is":[40,72,77,132],"mapped":[41],"on":[45],"its":[46],"list":[47],"L":[48],"\u2286":[52],").":[56],"An":[57],"important":[58],"result":[59],"by":[60],"Feder,":[61],"Hell,":[62],"and":[63,83],"Huang":[64],"[JGT":[65],"2003]":[66],"states":[67],"polynomial-time":[73,98],"solvable":[74],"if":[75,130],"so-called":[79],"bi-arc":[80,135],",":[82],"NP-complete":[84,89],"otherwise.":[85],"cases":[90],"problem":[93],"from":[94,158],"perspective":[96],"sparsification:":[99],"can":[100],"n":[102,119],"-vertex":[103],"instance":[104,111],"be":[105],"efficiently":[106],"reduced":[107],"equivalent":[110],"bitsize":[113],"\\(\\mathcal":[114],"{O}":[115],"(n^{2-\\varepsilon":[116],"})\\)":[117],"2-\u025b":[120],"for":[122],"some":[123],"\u025b":[124],"&gt;":[125],"0?":[126],"prove":[128],"not":[133,142,173],"graph,":[136],"then":[137],"does":[141],"admit":[143],"sparsification":[146],"algorithm":[147],"unless":[148],"\\(\\mathsf":[149],"{NP":[150],"\\subseteq":[151],"coNP/poly}\\)":[152],".":[153],"Our":[154],"proofs":[155],"combine":[156],"techniques":[157],"kernelization":[159],"lower":[160],"bounds":[161],"study":[164],"structure":[167],"graphs":[169],"which":[171],"are":[172],"bi-graphs.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}