{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:54:23Z","timestamp":1777100063939,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_18","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"255-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Word-Representable Graphs from\u00a0a\u00a0Word\u2019s Perspective"],"prefix":"10.1007","author":[{"given":"Pamela","family":"Fleischmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Haschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"L\u00f6ck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"issue":"13","key":"18_CR1","first-page":"3066","volume":"14","author":"S Chandrasekaran","year":"2019","unstructured":"Chandrasekaran, S., Sulthana, A.: k-Power domination of crown graph. IJAER 14(13), 3066\u20133068 (2019)","journal-title":"IJAER"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Cheon, G.-S., Kim, J., Kim, M., Kitaev, S., Pyatkin, A.: On k-11-representable graphs. J. Comb. 10(3) (2019)","DOI":"10.4310\/JOC.2019.v10.n3.a3"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s10878-018-0358-7","volume":"37","author":"I Choi","year":"2018","unstructured":"Choi, I., Kim, J., Kim, M.: On operations preserving semi-transitive orientability of graphs. J. Comb. Optim. 37(4), 1351\u20131366 (2018)","journal-title":"J. Comb. Optim."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.dam.2014.10.024","volume":"216","author":"A Collins","year":"2017","unstructured":"Collins, A., Kitaev, S., Lozin, V.V.: New results on word-representable graphs. Discret. Appl. Math. 216, 136\u2013141 (2017)","journal-title":"Discret. Appl. Math."},{"key":"18_CR5","unstructured":"Day, J.D., Fleischmann, P., Manea, F., Nowotka, D.: Local patterns. In: FSTTCS. LIPIcs, vol. 93, pp. 24:1\u201324:14 (2017)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.endm.2019.02.001","volume":"71","author":"JA Enright","year":"2019","unstructured":"Enright, J.A., Kitaev, S.: Polygon-circle and word-representable graphs. Electron. Notes Discret. Math. 71, 3\u20138 (2019)","journal-title":"Electron. Notes Discret. Math."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-030-67731-2_9","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"P Fleischmann","year":"2021","unstructured":"Fleischmann, P., Haschke, L., Manea, F., Nowotka, D., Tsida, C.T., Wiedenbeck, J.: Blocksequences of k-local words. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 119\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_9"},{"key":"18_CR8","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. Discret. Appl. Math. 284, 423\u2013433 (2020)","journal-title":"Discret. Appl. Math."},{"key":"18_CR9","unstructured":"Glen, M.E.: Colourability and word-representability of near-triangulations. abs\/1605.01688 (2018)"},{"key":"18_CR10","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: On representable graphs, semi-transitive orientations, and the representation numbers. CoRR, abs\/0810.0310 (2008)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-14455-4_41","volume-title":"Developments in Language Theory","author":"MM Halld\u00f3rsson","year":"2010","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: Graphs capturing alternations in words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 436\u2013437. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14455-4_41"},{"issue":"2","key":"18_CR12","first-page":"2","volume":"22","author":"ME Jones","year":"2015","unstructured":"Jones, M.E., Kitaev, S., Pyatkin, A.V., Remmel, J.B.: Representing graphs via pattern avoiding words. Electron. J. Comb. 22(2), 2 (2015)","journal-title":"Electron. J. Comb."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-031-33264-7_13","volume-title":"Developments in Language Theory","author":"BG Kenkireth","year":"2023","unstructured":"Kenkireth, B.G., Malhotra, A.S.: On word-representable and multi-word-representable graphs. In: Drewes, F., Volkov, M. (eds.) DLT 2023. LNCS, vol. 13911, pp. 156\u2013167. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33264-7_13"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-62809-7_2","volume-title":"Developments in Language Theory","author":"S Kitaev","year":"2017","unstructured":"Kitaev, S.: A comprehensive introduction to the theory of word-representable graphs. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 36\u201367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_2"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/jgt.22097","volume":"85","author":"S Kitaev","year":"2017","unstructured":"Kitaev, S.: Existence of $$u$$-representation of graphs. J. Graph Theory 85(3), 661\u2013668 (2017)","journal-title":"J. Graph Theory"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Kitaev, S., Lozin, V.V.: Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series (2015)","DOI":"10.1007\/978-3-319-25859-1"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Kitaev, S., Pyatkin, A.: On semi-transitive orientability of split graphs. CoRR, abs\/2110.08834 (2021)","DOI":"10.2139\/ssrn.4227619"},{"issue":"1","key":"18_CR18","first-page":"45","volume":"13","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Pyatkin, A.V.: On representable graphs. J. Autom. Lang. Comb. 13(1), 45\u201354 (2008)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11083-008-9083-7","volume":"25","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Seif, S.: Word problem of the Perkins semigroup via directed acyclic graphs. Order 25(3), 177\u2013194 (2008)","journal-title":"Order"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library (1997)","DOI":"10.1017\/CBO9780511566097"},{"issue":"2","key":"18_CR21","first-page":"202","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside\u2019s problem. Trans. Am. Math. Soc. 77(2), 202\u2013215 (1954)","journal-title":"Trans. Am. Math. Soc."},{"key":"18_CR22","unstructured":"Oliveros, D., Torres, A.: From word-representable graphs to altered Tverberg-type theorems. CoRR, abs\/2111.10038 (2021)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:22Z","timestamp":1711569862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","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":"Cochem","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}