{"id":"https://openalex.org/W7133303674","doi":"https://doi.org/10.48550/arxiv.2603.01244","title":"Hexasort -- The Complexity of Stacking Colors on Graphs","display_name":"Hexasort -- The Complexity of Stacking Colors on Graphs","publication_year":2026,"publication_date":"2026-03-01","ids":{"openalex":"https://openalex.org/W7133303674","doi":"https://doi.org/10.48550/arxiv.2603.01244"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.fun.2026.26","is_oa":true,"landing_page_url":"https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1052/_p","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"ConferencePaper"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1052/_p","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5127950271","display_name":"Linus Klocker","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klocker, Linus","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035535802","display_name":"Simon D. Fink","orcid":"https://orcid.org/0000-0002-2754-1195"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fink, Simon D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.4097999930381775,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.4097999930381775,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.23070000112056732,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.059300001710653305,"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/merge","display_name":"Merge (version control)","score":0.5866000056266785},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5659000277519226},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5221999883651733},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43380001187324524},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42980000376701355},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42309999465942383}],"concepts":[{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5866000056266785},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5659000277519226},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5221999883651733},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47870001196861267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4535999894142151},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41339999437332153},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.41269999742507935},{"id":"https://openalex.org/C33347731","wikidata":"https://www.wikidata.org/wiki/Q285210","display_name":"Stacking","level":2,"score":0.38280001282691956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3422999978065491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3422999978065491},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.26429998874664307}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.fun.2026.26","is_oa":true,"landing_page_url":"https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1052/_p","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2603.01244","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01244","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:doi:10.4230/lipics.fun.2026.26","is_oa":true,"landing_page_url":"https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1052/_p","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7259568572044373,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Many":[0],"popular":[1,63],"puzzle":[2],"and":[3,21,51,94,112,145],"matching":[4],"games":[5,30],"have":[6],"been":[7],"analyzed":[8],"through":[9],"the":[10,81,90,140],"lens":[11],"of":[12,43,47,83,89,117,125],"computational":[13],"complexity.":[14],"Prominent":[15],"examples":[16],"include":[17],"Sudoku,":[18],"Candy":[19],"Crush,":[20],"Flood-It.":[22],"A":[23],"common":[24],"theme":[25],"among":[26],"these":[27],"widely":[28],"played":[29],"is":[31,40,104],"that":[32,102],"their":[33,48],"generalized":[34],"decision":[35],"versions":[36],"are":[37],"NP-hard,":[38,105],"which":[39,139],"often":[41],"thought":[42],"as":[44,69,76],"a":[45,62,84],"source":[46],"inherent":[49],"difficulty":[50],"addictive":[52],"appeal":[53],"to":[54,97,109],"human":[55],"players.":[56],"In":[57],"this":[58],"paper,":[59],"we":[60,135],"study":[61],"single-player":[64],"stacking":[65],"game":[66,72],"commonly":[67],"known":[68],"Hexasort.":[70],"The":[71],"can":[73],"be":[74],"modelled":[75],"placing":[77],"colored":[78],"stacks":[79,88,111],"onto":[80],"vertices":[82],"graph,":[85],"where":[86],"adjacent":[87],"same":[91],"color":[92],"merge":[93],"vanish":[95],"according":[96],"deterministic":[98],"rules.":[99],"We":[100],"prove":[101],"Hexasort":[103],"even":[106],"when":[107],"restricted":[108],"single-color":[110],"progressively":[113],"more":[114],"constrained":[115],"classes":[116],"graphs,":[118],"culminating":[119],"in":[120,138],"strong":[121],"NP-hardness":[122],"on":[123],"trees":[124],"either":[126],"bounded":[127],"height":[128],"or":[129],"degree.":[130],"Towards":[131],"fixed-parameter":[132],"tractable":[133],"algorithms,":[134],"identify":[136],"settings":[137],"problem":[141],"becomes":[142],"polynomial-time":[143],"solvable":[144],"present":[146],"dynamic":[147],"programming":[148],"algorithms.":[149]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-04T00:00:00"}