APA (7th ed.) Citation

Fernau, H., Schmid, M. L., & Villanger, Y. (2016). On the Parameterised Complexity of String Morphism Problems. Theory of computing systems, 59(1), 24-51. https://doi.org/10.1007/s00224-015-9635-3

Chicago Style (17th ed.) Citation

Fernau, Henning, Markus L. Schmid, and Yngve Villanger. "On the Parameterised Complexity of String Morphism Problems." Theory of Computing Systems 59, no. 1 (2016): 24-51. https://doi.org/10.1007/s00224-015-9635-3.

MLA (9th ed.) Citation

Fernau, Henning, et al. "On the Parameterised Complexity of String Morphism Problems." Theory of Computing Systems, vol. 59, no. 1, 2016, pp. 24-51, https://doi.org/10.1007/s00224-015-9635-3.