{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:24Z","timestamp":1770921384792,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_7","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:52:58Z","timestamp":1770918778000},"page":"90-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Length Word-Representants of\u00a0Treelike Permutation Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0148-4137","authenticated-orcid":false,"given":"Tithi","family":"Dwary","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0795-1346","authenticated-orcid":false,"given":"K. V.","family":"Krishna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"8","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1016\/j.dam.2008.12.013","volume":"157","author":"S Cornelsen","year":"2009","unstructured":"Cornelsen, S., Di Stefano, G.: Treelike comparability graphs. Disc. Appl. Math. 157(8), 1711\u20131722 (2009)","journal-title":"Disc. Appl. Math."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.dam.2025.10.055","volume":"380","author":"T Dwary","year":"2026","unstructured":"Dwary, T., Krishna, K.V.: Characterization of double-arborescences and their minimum length word-representants. Disc. Appl. Math. 380, 599\u2013611 (2026)","journal-title":"Disc. Appl. Math."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S Even","year":"1972","unstructured":"Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. J. Assoc. Comput. Mach. 19, 400\u2013410 (1972)","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.dam.2020.03.063","volume":"284","author":"M Gaetz","year":"2020","unstructured":"Gaetz, M., Ji, C.: Enumeration and extensions of word-representants. Disc. Appl. Math. 284, 423\u2013433 (2020)","journal-title":"Disc. Appl. Math."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Ann. Disc. Math. 57, 2nd edn (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.12957\/cadinf.2022.70585","volume":"47","author":"MC Golumbic","year":"2022","unstructured":"Golumbic, M.C.: Why are they called trivially perfect graphs? Cadernos do IME-S\u00e9rie Inform\u00e1tica 47, 40\u201345 (2022)","journal-title":"Cadernos do IME-S\u00e9rie Inform\u00e1tica"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: Alternation graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 191\u2013202. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_18","DOI":"10.1007\/978-3-642-25870-1_18"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Kitaev, S.,\u00a0Lozin, V.: Words and graphs. In: Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-25859-1"},{"issue":"1","key":"7_CR9","first-page":"45","volume":"13","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Pyatkin, A.: On representable graphs. J. Autom. Lang. Comb. 13(1), 45\u201354 (2008)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1\u20133","key":"7_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Disc. Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Disc. Math."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2023.10.021","volume":"343","author":"E Srinivasan","year":"2024","unstructured":"Srinivasan, E., Hariharasubramanian, R.: Minimum length word-representants of word-representable graphs. Disc. Appl. Math. 343, 149\u2013158 (2024)","journal-title":"Disc. Appl. Math."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1090\/S0002-9939-1962-0172273-0","volume":"13","author":"ES Wolk","year":"1962","unstructured":"Wolk, E.S.: The comparability graph of a tree. Proc. Amer. Math. Soc. 13, 789\u2013795 (1962)","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:00Z","timestamp":1770918780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}