{"id":"https://openalex.org/W7161275369","doi":"https://doi.org/10.4230/lipics.fun.2026.37","title":"Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers","display_name":"Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7161275369","doi":"https://doi.org/10.4230/lipics.fun.2026.37"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25756","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.37/LIPIcs.FUN.2026.37.pdf","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":null,"raw_type":"InProceedings"},"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.37/LIPIcs.FUN.2026.37.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034338968","display_name":"Keigo Oka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oka, Keigo","raw_affiliation_strings":["Google, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0009-0007-8119-9267","affiliations":[{"raw_affiliation_string":"Google, Tokyo, Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126712994","display_name":"Naoki Inaba","orcid":null},"institutions":[{"id":"https://openalex.org/I4210154483","display_name":"BoZo Research Center (Japan)","ror":"https://ror.org/047kd7281","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210154483"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Inaba, Naoki","raw_affiliation_strings":["Puzzle creator, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Puzzle creator, Japan","institution_ids":["https://openalex.org/I4210154483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5136200884","display_name":"Akira Iino","orcid":null},"institutions":[{"id":"https://openalex.org/I4210089404","display_name":"Toshima Manufacturing (Japan)","ror":"https://ror.org/009ag0z22","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210089404"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Iino, Akira","raw_affiliation_strings":["Nippon Hyoron Sha, Co., Ltd., Toshima, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nippon Hyoron Sha, Co., Ltd., Toshima, Japan","institution_ids":["https://openalex.org/I4210089404"]}]}],"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.57306733,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5709999799728394,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5709999799728394,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.08940000087022781,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11887","display_name":"Quasicrystal Structures and Properties","score":0.03449999913573265,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.8104000091552734},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6462000012397766},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6216999888420105},{"id":"https://openalex.org/keywords/stain","display_name":"Stain","score":0.5320000052452087},{"id":"https://openalex.org/keywords/polyomino","display_name":"Polyomino","score":0.5105000138282776},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4740999937057495}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.8104000091552734},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6462000012397766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6287999749183655},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6216999888420105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6150000095367432},{"id":"https://openalex.org/C2781294515","wikidata":"https://www.wikidata.org/wiki/Q2733470","display_name":"Stain","level":3,"score":0.5320000052452087},{"id":"https://openalex.org/C69919132","wikidata":"https://www.wikidata.org/wiki/Q1144819","display_name":"Polyomino","level":3,"score":0.5105000138282776},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4740999937057495},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4296000003814697},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3603000044822693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33570000529289246},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3301999866962433},{"id":"https://openalex.org/C65682993","wikidata":"https://www.wikidata.org/wiki/Q1056451","display_name":"Reflection (computer programming)","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25756","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.37/LIPIcs.FUN.2026.37.pdf","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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fun.2026.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2026.37","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25756","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.37/LIPIcs.FUN.2026.37.pdf","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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161275369.pdf","grobid_xml":"https://content.openalex.org/works/W7161275369.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"You":[0],"find":[1,29],"a":[2,16,30,108,113,146,167],"stain":[3,55,115],"on":[4],"the":[5,37,51,62,71,93,103,129,133,142,151],"wall":[6],"and":[7,21,49,66],"decide":[8],"to":[9,28,35,91,128],"cover":[10,36,112,121],"it":[11,26,161],"with":[12],"non-overlapping":[13],"stickers":[14],"of":[15,53,95,105,141,170],"single":[17],"identical":[18],"shape":[19,32],"(rotation":[20],"reflection":[22],"are":[23],"allowed).":[24],"Is":[25],"possible":[27],"sticker":[31,110,153],"that":[33,77,102,158],"fails":[34],"stain?":[38],"In":[39],"this":[40,44],"paper,":[41],"we":[42],"consider":[43],"problem":[45,104,143],"under":[46],"polyomino":[47],"constraints":[48],"complete":[50],"classification":[52,86],"always-coverable":[54,64,74],"shapes":[56],"(polyominoes).":[57],"We":[58,99],"provide":[59],"proofs":[60],"for":[61,70,145],"maximal":[63],"polyominoes":[65],"construct":[67],"concrete":[68],"counterexamples":[69],"minimal":[72],"not":[73,123,164],"ones,":[75],"demonstrating":[76],"such":[78],"cases":[79],"exist":[80],"even":[81,118],"among":[82],"hole-free":[83],"polyominoes.":[84],"This":[85,125],"consequently":[87],"yields":[88],"an":[89,139],"algorithm":[90],"determine":[92],"always-coverability":[94],"any":[96],"given":[97,109,114],"stain.":[98],"also":[100],"show":[101],"determining":[106],"whether":[107],"can":[111],"is":[116,122,136],"NP-complete,":[117],"though":[119],"exact":[120],"demanded.":[124],"result":[126],"extends":[127],"1D":[130],"case":[131],"where":[132],"connectivity":[134],"requirement":[135],"removed.":[137],"As":[138],"illustration":[140],"complexity,":[144],"specific":[147],"hexomino":[148],"(6-cell)":[149],"stain,":[150],"smallest":[152],"found":[154],"in":[155],"our":[156],"search":[157],"avoids":[159],"covering":[160],"has,":[162],"although":[163],"proven":[165],"minimum,":[166],"bounding":[168],"box":[169],"325":[171],"\u00d7":[172],"325.":[173]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-16T00:00:00"}