1. Bulteau, L., Hüffner, F., Komusiewicz, C., Niedermeier, R.: Multivariate algorithmics for NP-hard string problems. Bull. EATCS 114, 295–301 (2014)
2. Lecture Notes in Computer Science;R Clifford,2009
3. Condon, A., Maňuch, J., Thachuk, C.: The complexity of string partitioning. J. Discrete Algorithms 32, 24–43 (2015)
4. Fernau, H., Manea, F., Mercas, R., Schmid, M.L.: Pattern matching with variables: fast algorithms and new hardness results. In: 32nd International Symposium on Theoretical Aspects of Computer Science, 4–7 March 2015, Garching, Germany, pp. 302–315 (2015)
5. Schmid, M.L.: Computing equality-free and repetitive string factorisations. Theor. Comput. Sci. 618, 42–51 (2016)