{"id":"https://openalex.org/W4379193147","doi":"https://doi.org/10.29007/qrmp","title":"Toward Optimal Radio Colorings of Hypercubes via SAT-solving","display_name":"Toward Optimal Radio Colorings of Hypercubes via SAT-solving","publication_year":2023,"publication_date":"2023-06-03","ids":{"openalex":"https://openalex.org/W4379193147","doi":"https://doi.org/10.29007/qrmp"},"language":"en","primary_location":{"id":"doi:10.29007/qrmp","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/qrmp","pdf_url":"https://easychair.org/publications/open/b8Cn","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/b8Cn","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030108071","display_name":"Bernardo Subercaseaux","orcid":"https://orcid.org/0000-0003-2295-1299"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bernardo Subercaseaux","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marijn Heule","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030108071"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1946,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52112583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"94","issue":null,"first_page":"386","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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.9950000047683716,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9925000071525574,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9866999983787537,"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/hypercube","display_name":"Hypercube","score":0.8393145799636841},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6690213680267334},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5754390954971313},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5477872490882874},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4965243935585022},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49359357357025146},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.491835355758667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46873459219932556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4635915160179138},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4419931173324585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4063419699668884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3740890622138977},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09416306018829346},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06855395436286926}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.8393145799636841},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6690213680267334},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5754390954971313},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5477872490882874},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4965243935585022},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49359357357025146},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.491835355758667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46873459219932556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4635915160179138},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4419931173324585},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4063419699668884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3740890622138977},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09416306018829346},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06855395436286926},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/qrmp","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/qrmp","pdf_url":"https://easychair.org/publications/open/b8Cn","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/qrmp","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/qrmp","pdf_url":"https://easychair.org/publications/open/b8Cn","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7352054642","display_name":"SHF: Small: WLoS: Without Loss of Satisfaction","funder_award_id":"2015445","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4379193147.pdf","grobid_xml":"https://content.openalex.org/works/W4379193147.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2013252038","https://openalex.org/W2386598361","https://openalex.org/W2078375028","https://openalex.org/W4291316360","https://openalex.org/W1542397451","https://openalex.org/W2793500002","https://openalex.org/W4390280037","https://openalex.org/W1170108254","https://openalex.org/W4298054421","https://openalex.org/W1965626709"],"abstract_inverted_index":{"Radio":[0],"2-colorings":[1,76],"of":[2,7,14,25,37,77,122],"graphs":[3],"are":[4,29,52,127],"a":[5,22,26,64,81,147],"generalization":[6],"vertex":[8],"colorings":[9],"motivated":[10],"by":[11,44,55,95,155],"the":[12,35,70,90,118,133,177],"problem":[13,83,154],"assigning":[15],"frequency":[16],"channels":[17],"in":[18,89],"radio":[19,23,75],"networks.":[20],"In":[21],"2-coloring":[24],"graph,":[27],"vertices":[28,39],"assigned":[30],"integer":[31],"colors":[32],"so":[33,94],"that":[34,84,109,164,174],"color":[36],"two":[38],"u":[40,49,60],"and":[41,50,54,61,104,106,114],"v":[42,51,62],"differ":[43],"at":[45,56],"least":[46,57],"2":[47],"if":[48,59],"neighbors,":[53],"1":[58],"have":[63],"common":[65],"neighbor.":[66],"Our":[67],"work":[68],"improves":[69],"best-known":[71],"bounds":[72,121],"for":[73,110,135,168,179],"optimal":[74],"small":[78],"hypercube":[79],"graphs,":[80],"combinatorial":[82,162],"has":[85],"received":[86],"significant":[87],"attention":[88],"past.":[91],"We":[92],"do":[93],"using":[96],"automated":[97],"reasoning":[98],"techniques":[99],"such":[100],"as":[101],"symmetry":[102],"breaking":[103],"Cube":[105],"Conquer,":[107],"obtaining":[108],"n":[111,115,136,180],"=":[112,116,137,181],"7":[113,138,182],"8,":[117],"coding-theory":[119],"upper":[120],"Whittlesey":[123],"et":[124],"al.":[125],"(1995)":[126],"not":[128],"tight.":[129],"Moreover,":[130],"we":[131,159],"prove":[132],"answer":[134,178],"to":[139],"be":[140,166],"either":[141],"12":[142],"or":[143],"13,":[144],"thus":[145],"making":[146],"substantial":[148],"step":[149],"towards":[150],"answering":[151],"an":[152],"open":[153],"Knuth":[156],"(2015).":[157],"Finally,":[158],"include":[160],"several":[161],"observations":[163],"might":[165],"useful":[167],"further":[169],"progress,":[170],"while":[171],"also":[172],"arguing":[173],"fully":[175],"determining":[176],"will":[183],"require":[184],"new":[185],"techniques.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}