{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:20:39Z","timestamp":1762298439345,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_25","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"306-318","source":"Crossref","is-referenced-by-count":5,"title":["On the Solvability Problem for Restricted Classes of Word Equations"],"prefix":"10.1007","author":[{"given":"Florin","family":"Manea","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[]},{"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer International Publishing AG, Cham (2015)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Da\u0327browski, R., Plandowski, W.: Solving two-variable word equations. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 408\u2013419. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27836-8_36"},{"key":"25_CR3","unstructured":"Fernau, H., Manea, F., Merca\u015f, R., Schmid, M.L.: Pattern matching with variables: fast algorithms and new hardness results. In: Proceedings of 32nd Symposium on Theoretical Aspects of Computer Science, STACS 2015, Leibniz International Proceedings in Informatics (LIPIcs), vol. 30, pp. 302\u2013315 (2015)"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.ic.2015.03.006","volume":"242","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Schmid, M.L.: Pattern matching with variables: a multivariate complexity analysis. Inf. Comput. 242, 287\u2013305 (2015)","journal-title":"Inf. Comput."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Fernau, H., Schmid, M.L., Villanger, Y.: On the parameterised complexity of string morphism problems. Theory of Computing Systems (2015). http:\/\/dx.doi.org\/10.1007\/s00224-015-9635-3","DOI":"10.1007\/s00224-015-9635-3"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-014-9931-3","volume":"74","author":"A Je\u017c","year":"2016","unstructured":"Je\u017c, A.: One-variable word equations in linear time. Algorithmica 74, 1\u201348 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR8","first-page":"4:1","volume":"63","author":"A Je\u017c","year":"2016","unstructured":"Je\u017c, A.: Recompression: a simple and powerful technique for word equations. J. ACM 63(1), 4:1\u20134:51 (2016)","journal-title":"J. ACM"},{"key":"25_CR9","first-page":"396","volume-title":"Proceedings of 13th Symposium on Mathematical Foundations of Computer Science","author":"J Kratochv\u00edl","year":"1988","unstructured":"Kratochv\u00edl, J., Kr\u0306iv\u00e1nek, M.: On the computational complexity of codes in graphs. In: Chytil, M.P., Koubek, V., Janiga, L. (eds.) MFCS 1988. LNCS, vol. 324, pp. 396\u2013404. Springer, Heidelberg (1988)"},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"25_CR11","first-page":"147","volume":"103","author":"G Makanin","year":"1977","unstructured":"Makanin, G.: The problem of solvability of equations in a free semigroup. Matematicheskii Sbornik 103, 147\u2013236 (1977)","journal-title":"Matematicheskii Sbornik"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: An efficient algorithm for solving word equations. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 467\u2013476 (2006)","DOI":"10.1145\/1132516.1132584"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ic.2014.08.010","volume":"239","author":"D Reidenbach","year":"2014","unstructured":"Reidenbach, D., Schmid, M.L.: Patterns with bounded treewidth. Inf. Comput. 239, 87\u201399 (2014)","journal-title":"Inf. Comput."},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-49116-3_20","volume-title":"STACS 99","author":"JM Robson","year":"1999","unstructured":"Robson, J.M., Diekert, V.: On quadratic word equations. STACS 1999. LNCS, vol. 1563, pp. 217\u2013226. Springer, Heidelberg (1999)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:56Z","timestamp":1498315556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}