1. Balcázar, J.L., Diaz, J., Gabarró, J.: Structural Complexity I, 2nd edn. Springer, Heidelberg (1995).
https://doi.org/10.1007/978-3-642-79235-9
2. Lecture Notes in Computer Science;H Björklund,2013
3. Boas, P.V.E.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory, pp. 331–363. Marcel Dekker Inc. (1997)
4. Bulteau, L., Hüffner, F., Komusiewicz, C., Niedermeier, R.: Multivariate algorithmics for NP-hard string problems. Bull. EATCS, 114 (2014)
5. Calude, C.S., Salomaa, K., Yu, S.: Additive distances and quasi-distances between words. J. Univ. Comput. Sci. 8(2), 141–152 (2002)