{"id":"https://openalex.org/W7161262641","doi":"https://doi.org/10.4230/lipics.fun.2026.26","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-01-01","ids":{"openalex":"https://openalex.org/W7161262641","doi":"https://doi.org/10.4230/lipics.fun.2026.26"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25745","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.26/LIPIcs.FUN.2026.26.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.26/LIPIcs.FUN.2026.26.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5127950271","display_name":"Linus Klocker","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Klocker, Linus","raw_affiliation_strings":["TU Wien, Austria"],"raw_orcid":"https://orcid.org/0009-0007-2937-9586","affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035535802","display_name":"Simon D. Fink","orcid":"https://orcid.org/0000-0002-2754-1195"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Fink, Simon Dominik","raw_affiliation_strings":["Department of Algorithms and Complexity, TU Wien, Austria"],"raw_orcid":"https://orcid.org/0000-0002-2754-1195","affiliations":[{"raw_affiliation_string":"Department of Algorithms and Complexity, TU Wien, Austria","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.7710359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.6754000186920166,"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.6754000186920166,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.04610000178217888,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.03319999948143959,"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/bounded-function","display_name":"Bounded function","score":0.5385000109672546},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5210999846458435},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.4991999864578247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4180000126361847},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4172999858856201},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.40939998626708984}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5210999846458435},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.4991999864578247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4839000105857849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46320000290870667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4271000027656555},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4172999858856201},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.40939998626708984},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38839998841285706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3702999949455261},{"id":"https://openalex.org/C33347731","wikidata":"https://www.wikidata.org/wiki/Q285210","display_name":"Stacking","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2549999952316284}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25745","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.26/LIPIcs.FUN.2026.26.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.fun.2026.26","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2026.26","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":"pmh:oai:drops-oai.dagstuhl.de:25745","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.26/LIPIcs.FUN.2026.26.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"score":0.730343759059906,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1382289185","display_name":"Parameterized Analysis in Artificial Intelligence","funder_award_id":"Y1329","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G2813764235","display_name":null,"funder_award_id":"10.47379/ICT22029","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G6233901216","display_name":null,"funder_award_id":"10.55776/Y1329","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7247946260","display_name":null,"funder_award_id":"10.47379/","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G8590477180","display_name":null,"funder_award_id":"10.55776","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161262641.pdf","grobid_xml":"https://content.openalex.org/works/W7161262641.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Many":[0],"popular":[1,78],"puzzle":[2],"and":[3,21,32,66,109,127,160],"matching":[4],"games":[5,45],"have":[6],"been":[7],"analyzed":[8],"through":[9],"the":[10,96,105,155],"lens":[11],"of":[12,58,62,98,104,132,140],"computational":[13],"complexity.":[14],"Prominent":[15],"examples":[16],"include":[17],"Sudoku":[18],"[Takayuki":[19],"Yato":[20],"Takahiro":[22],"Seta,":[23],"2003],":[24],"Candy":[25],"Crush":[26],"[Luciano":[27],"Gual\u00e0":[28],"et":[29,35],"al.,":[30,36],"2014],":[31],"Flood-It":[33],"[Fellows":[34],"2018].":[37],"A":[38],"common":[39],"theme":[40],"among":[41],"these":[42],"widely":[43],"played":[44],"is":[46,55,119],"that":[47,117],"their":[48,63],"generalized":[49],"decision":[50],"versions":[51],"are":[52],"NP-hard,":[53,120],"which":[54,154],"often":[56],"thought":[57],"as":[59,84,91],"a":[60,77,99],"source":[61],"inherent":[64],"difficulty":[65],"addictive":[67],"appeal":[68],"to":[69,112,124],"human":[70],"players.":[71],"In":[72],"this":[73],"paper,":[74],"we":[75,150],"study":[76],"single-player":[79],"stacking":[80],"game":[81,87],"commonly":[82],"known":[83],"Hexasort.":[85],"The":[86],"can":[88],"be":[89],"modelled":[90],"placing":[92],"colored":[93],"stacks":[94,103,126],"onto":[95],"vertices":[97],"graph,":[100],"where":[101],"adjacent":[102],"same":[106],"color":[107],"merge":[108],"vanish":[110],"according":[111],"deterministic":[113],"rules.":[114],"We":[115],"prove":[116],"Hexasort":[118],"even":[121],"when":[122],"restricted":[123],"single-color":[125],"progressively":[128],"more":[129],"constrained":[130],"classes":[131],"graphs,":[133],"culminating":[134],"in":[135,153],"strong":[136],"NP-hardness":[137],"on":[138],"trees":[139],"either":[141],"bounded":[142],"height":[143],"or":[144],"degree.":[145],"Towards":[146],"fixed-parameter":[147],"tractable":[148],"algorithms,":[149],"identify":[151],"settings":[152],"problem":[156],"becomes":[157],"polynomial-time":[158],"solvable":[159],"present":[161],"dynamic":[162],"programming":[163],"algorithms.":[164]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-16T00:00:00"}