{"id":"https://openalex.org/W7129082485","doi":"https://doi.org/10.48550/arxiv.2602.12780","title":"The Complexity of Homomorphism Reconstruction Revisited","display_name":"The Complexity of Homomorphism Reconstruction Revisited","publication_year":2026,"publication_date":"2026-02-13","ids":{"openalex":"https://openalex.org/W7129082485","doi":"https://doi.org/10.48550/arxiv.2602.12780"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.stacs.2026.45","is_oa":true,"landing_page_url":null,"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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066080280","display_name":"Timo Gervens","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gervens, Timo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126092591","display_name":"Martin Grohe","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grohe, Martin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067198614","display_name":"Louis H\u00e4rtel","orcid":"https://orcid.org/0009-0004-3446-5874"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H\u00e4rtel, Louis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126099827","display_name":"Philipp Silva da Fonseca","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fonseca, Philipp da Silva","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5066080280"],"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.23160000145435333,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.23160000145435333,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1907999962568283,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.13099999725818634,"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/homomorphism","display_name":"Homomorphism","score":0.8438000082969666},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7784000039100647},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.5504999756813049},{"id":"https://openalex.org/keywords/algebra-homomorphism","display_name":"Algebra homomorphism","score":0.5260999798774719},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5232999920845032},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.47780001163482666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4494999945163727},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4341000020503998}],"concepts":[{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.8438000082969666},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7784000039100647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6747999787330627},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6126000285148621},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.5504999756813049},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5460000038146973},{"id":"https://openalex.org/C175316100","wikidata":"https://www.wikidata.org/wiki/Q3882299","display_name":"Algebra homomorphism","level":3,"score":0.5260999798774719},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5232999920845032},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.47780001163482666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4341000020503998},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.37459999322891235},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.3005000054836273},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.27970001101493835},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.26420000195503235},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.26339998841285706},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.stacs.2026.45","is_oa":true,"landing_page_url":null,"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.2602.12780","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.12780","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.stacs.2026.45","is_oa":true,"landing_page_url":null,"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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,51],"revisit":[1],"the":[2,38,54,59,81,91],"algorithmic":[3],"problem":[4,55],"of":[5,40,96],"reconstructing":[6],"a":[7,33,75],"graph":[8,34],"from":[9,42],"homomorphism":[10],"counts":[11,27,60],"that":[12,37,53,80],"has":[13],"first":[14],"been":[15],"studied":[16],"in":[17,64,71,87],"(B\u00f6ker":[18],"et":[19],"al.,":[20],"STACS":[21],"2024):":[22],"given":[23],"graphs":[24,93],"$F_1,\\ldots,F_k$":[25],"and":[26,66],"$m_1,\\ldots,m_k$,":[28],"decide":[29],"if":[30,58,68,90],"there":[31],"is":[32,46,56],"$G$":[35,45],"such":[36],"number":[39],"homomorphisms":[41],"$F_i$":[43],"to":[44],"$m_i$,":[47],"for":[48],"all":[49],"$i$.":[50],"prove":[52],"NEXP-hard":[57],"$m_i$":[61],"are":[62,70,94],"specified":[63],"binary":[65],"$\u03a3_2^p$-complete":[67],"they":[69],"unary.":[72],"Furthermore,":[73],"as":[74],"positive":[76],"result,":[77],"we":[78],"show":[79],"unary":[82],"version":[83],"can":[84],"be":[85],"solved":[86],"polynomial":[88],"time":[89],"constraint":[92],"stars":[95],"bounded":[97],"size.":[98]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-17T00:00:00"}