{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:46:14Z","timestamp":1742931974252,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_15","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"242-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unshuffling Permutations: Trivial Bijections and Compositions"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[]},{"given":"Samuele","family":"Giraudo","sequence":"additional","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65(5), 277\u2013283 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.jcss.2013.11.002","volume":"80","author":"S Buss","year":"2014","unstructured":"Buss, S., Soltys, M.: Unshuffling a square is NP-hard. J. Comput. Syst. Sci. 80(4), 766\u2013776 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 329\u2013438. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_6"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2018.02.007","volume":"729","author":"S Giraudo","year":"2018","unstructured":"Giraudo, S., Vialette, S.: Algorithmic and algebraic aspects of unshuffling permutations. Theor. Comput. Sci. 729, 20\u201341 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR5","volume-title":"The Art of Computer Programming: Volume III: Sorting and Searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming: Volume III: Sorting and Searching. Addison-Wesley, Boston (1973)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/0020-0190(82)90138-7","volume":"14","author":"J van Leeuwen","year":"1982","unstructured":"van Leeuwen, J., Nivat, M.: Efficient recognition of rational relations. Inf. Process. Lett. 14(1), 34\u201338 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0166-218X(83)90021-5","volume":"5","author":"A Mansfield","year":"1983","unstructured":"Mansfield, A.: On the computational complexity of a merge recognition problem. Discrete Appl. Math. 5(1), 119\u2013122 (1983)","journal-title":"Discrete Appl. Math."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-46049-9_25","volume-title":"String Processing and Information Retrieval","author":"BE Neou","year":"2016","unstructured":"Neou, B.E., Rizzi, R., Vialette, S.: Pattern matching for separable permutations. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 260\u2013272. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46049-9_25"},{"doi-asserted-by":"crossref","unstructured":"Rizzi, R., Vialette, S.: On recognizing words that are squares for the shuffle product. In: Proceedings of the 8th International Symposium in Computer Science - Theory and Applications, pp. 235\u2013245 (2013)","key":"15_CR9","DOI":"10.1007\/978-3-642-38536-0_21"},{"unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences. https:\/\/oeis.org\/","key":"15_CR10"},{"issue":"1\u20133","key":"15_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","volume":"132","author":"Z Stankova","year":"1994","unstructured":"Stankova, Z.: Forbidden subsequences. Discrete Math. 132(1\u20133), 291\u2013316 (1994)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Vargas, Y.: Hopf algebra of permutation pattern functions. In: 26th International Conference on Formal Power Series and Algebraic Combinatorics, pp. 839\u2013850 (2014)","key":"15_CR12","DOI":"10.46298\/dmtcs.2446"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:08:41Z","timestamp":1709824121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}