{"id":"https://openalex.org/W4416095646","doi":"https://doi.org/10.1007/s00453-025-01341-9","title":"Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions","display_name":"Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions","publication_year":2025,"publication_date":"2025-11-10","ids":{"openalex":"https://openalex.org/W4416095646","doi":"https://doi.org/10.1007/s00453-025-01341-9"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01341-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01341-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01341-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01341-9.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021958252","display_name":"Bogdan Alecu","orcid":"https://orcid.org/0000-0002-5515-9145"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bogdan Alecu","raw_affiliation_strings":["School of Computer Science, University of Leeds, Leeds, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086757058","display_name":"Mamadou Moustapha Kant\u00e9","orcid":"https://orcid.org/0000-0003-1838-7744"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mamadou Moustapha Kant\u00e9","raw_affiliation_strings":["Universit\u00e9 Clermont Auvergne, Clermont Auvergne INP, LIMOS, CNRS, Clermont-Ferrand, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Clermont Auvergne, Clermont Auvergne INP, LIMOS, CNRS, Clermont-Ferrand, France","institution_ids":["https://openalex.org/I198244214","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081581015","display_name":"Vadim Lozin","orcid":"https://orcid.org/0000-0003-2464-7389"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vadim Lozin","raw_affiliation_strings":["Mathematics Institute, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Mathematics Institute, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047948708","display_name":"Viktor Zamaraev","orcid":"https://orcid.org/0000-0001-5755-4141"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Viktor Zamaraev","raw_affiliation_strings":["School of Computer Science and Informatics, University Liverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, University Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047948708"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35720349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8892999887466431,"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.8892999887466431,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.05009999871253967,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03530000150203705,"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/bounded-function","display_name":"Bounded function","score":0.739799976348877},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6474000215530396},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6100000143051147},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46239998936653137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4535999894142151},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.44589999318122864},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4361000061035156},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.40450000762939453}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.739799976348877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6538000106811523},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6474000215530396},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6100000143051147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6082000136375427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5722000002861023},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46239998936653137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4535999894142151},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.44589999318122864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4392000138759613},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.40450000762939453},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.3257000148296356},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.32440000772476196},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.30720001459121704},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.28040000796318054},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.27630001306533813},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.27630001306533813},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.265500009059906},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-025-01341-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01341-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01341-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01341-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01341-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-025-01341-9.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4416095646.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1974351233","https://openalex.org/W1993328543","https://openalex.org/W1994584977","https://openalex.org/W2011632049","https://openalex.org/W2015142920","https://openalex.org/W2063951771","https://openalex.org/W2092807942","https://openalex.org/W2131742729","https://openalex.org/W2137616550","https://openalex.org/W2139665196","https://openalex.org/W2149785904","https://openalex.org/W2153230366","https://openalex.org/W2266173563","https://openalex.org/W2997844190","https://openalex.org/W3178242102","https://openalex.org/W4235239597","https://openalex.org/W4403128500"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Lettericity":[1],"is":[2],"a":[3,56],"graph":[4,111],"parameter":[5],"responsible":[6],"for":[7],"many":[8,47],"attractive":[9],"structural":[10],"properties.":[11],"In":[12,83],"particular,":[13],"graphs":[14,38,77,95],"of":[15,37,39,61,75,96,112],"bounded":[16,19,40],"lettericity":[17,41,97,113],"have":[18],"linear":[20],"clique-width":[21],"and":[22,68,106],"they":[23],"are":[24,78],"well-quasi-ordered":[25],"by":[26,45],"induced":[27,49],"subgraphs.":[28,50],"The":[29],"latter":[30],"property":[31],"implies":[32],"that":[33,91,108],"any":[34,109],"hereditary":[35],"class":[36],"can":[42],"be":[43],"described":[44],"finitely":[46],"forbidden":[48,76],"This,":[51],"in":[52,55,101],"turn,":[53],"implies,":[54],"non-constructive":[57],"way,":[58],"polynomial-time":[59],"recognition":[60],"such":[62],"classes.":[63],"However,":[64],"no":[65,69],"constructive":[66],"algorithms":[67],"specific":[70],"bounds":[71],"on":[72],"the":[73,84],"size":[74],"available":[79],"up":[80],"to":[81],"date.":[82],"present":[85],"paper,":[86],"we":[87],"develop":[88],"an":[89],"algorithm":[90],"recognizes":[92],"n":[93],"-vertex":[94],"at":[98,118],"most":[99,119],"k":[100,116],"time":[102],"$$f(k)":[103],"\\cdot":[104],"n^3$$":[105],"show":[107],"minimal":[110],"more":[114],"than":[115],"has":[117],"$$2^{O(k^2\\log":[120],"k)}$$":[121],"vertices.":[122]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-11-10T00:00:00"}