{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:22Z","timestamp":1784484142759,"version":"3.55.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_20","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:10Z","timestamp":1784482150000},"page":"304-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Settling the\u00a0Complexity of\u00a0the\u00a0Lettericity Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8103-6440","authenticated-orcid":false,"given":"Mario","family":"Grobler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7283-4982","authenticated-orcid":false,"given":"Nils","family":"Morawietz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6850-1298","authenticated-orcid":false,"given":"Silas Cato","family":"Sacher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2774","DOI":"10.1137\/21M1449646","volume":"36","author":"B Alecu","year":"2022","unstructured":"Alecu, B., Ferguson, R., Kant\u00e9, M.M., Lozin, V.V., Vatter, V., Zamaraev, V.: Letter graphs and geometric grid classes of permutations. SIAM J. Discret. Math. 36(4), 2774\u20132797 (2022)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00453-025-01341-9","volume":"88","author":"B Alecu","year":"2026","unstructured":"Alecu, B., Kant\u00e9, M.M., Lozin, V.V., Zamaraev, V.: Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. Algorithmica 88(1), 2 (2026)","journal-title":"Algorithmica"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Alecu, B., Lozin, V.: Understanding lettericity I: a structural hierarchy. CoRR abs\/2106.03267 (2021). https:\/\/doi.org\/10.48550\/ARXIV.2106.03267","DOI":"10.48550\/ARXIV.2106.03267"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.disc.2014.09.008","volume":"338","author":"A Atminas","year":"2015","unstructured":"Atminas, A., Collins, A., Lozin, V.V., Zamaraev, V.: Implicit representations and factorial properties of graphs. Discret. Math. 338(2), 164\u2013179 (2015)","journal-title":"Discret. Math."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s11786-016-0257-1","volume":"10","author":"S Bera","year":"2016","unstructured":"Bera, S., Mahalingam, K.: Structural properties of word representable graphs. Math. Comput. Sci. 10(2), 209\u2013222 (2016)","journal-title":"Math. Comput. Sci."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.dam.2018.03.072","volume":"261","author":"F Bonomo","year":"2019","unstructured":"Bonomo, F., de Estrada, D.: On the thinness and proper thinness of a graph. Discret. Appl. Math. 261, 78\u201392 (2019)","journal-title":"Discret. Appl. Math."},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Feng, Z., Fernau, H., Fleischmann, P., Kindermann, P., Sacher, S.C.: Determining factorial speed fast. CoRR abs\/2602.24064 (2026). https:\/\/doi.org\/10.48550\/ARXIV.2602.24064","DOI":"10.48550\/ARXIV.2602.24064"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Feng, Z., Fernau, H., Mann, K., Raman, I., Sacher, S.C.: Generalized lettericity of graphs. In: Gaur, D., Mathew, R. (eds.) CALDAM 2025. LNCS, vol 15536. pp. 134\u2013146. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-83438-7_12","DOI":"10.1007\/978-3-031-83438-7_12"},{"key":"20_CR9","first-page":"348","volume":"78","author":"R Ferguson","year":"2020","unstructured":"Ferguson, R.: On the lettericity of paths. Austr. J. Combin. 78, 348\u2013351 (2020)","journal-title":"Austr. J. Combin."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.dam.2021.11.007","volume":"309","author":"R Ferguson","year":"2022","unstructured":"Ferguson, R., Vatter, V.: Letter graphs and modular decomposition. Discret. Appl. Math. 309, 215\u2013220 (2022)","journal-title":"Discret. Appl. Math."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Mandrick, S., Vatter, V.: Bounds on the lettericity of graphs. Electron. J. Combin. 31(4) (2024)","DOI":"10.37236\/12411"},{"key":"20_CR12","unstructured":"Mannino, C., Oriolo, G., Ricci, F.: Solving stability problems on a superclass of interval graphs. Universit\u2019a di Roma La Sapienza. Dipartimento di Informatica e Sistemistica 26(02) (2002)"},{"issue":"1\u20133","key":"20_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0012-365X(01)00094-2","volume":"244","author":"M Petkovsek","year":"2002","unstructured":"Petkovsek, M.: Letter graphs and well-quasi-order by induced subgraphs. Discret. Math. 244(1\u20133), 375\u2013388 (2002)","journal-title":"Discret. Math."},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.2140\/pjm.2025.339.333","volume":"339","author":"Y Shitov","year":"2025","unstructured":"Shitov, Y.: Graph thinness: a lower bound and complexity. Pac. J. Math. 339(2), 333\u2013343 (2025)","journal-title":"Pac. J. Math."}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:11Z","timestamp":1784482151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}