On the Parameterised Complexity of String Morphism Problems. Fernau, H., Schmid, M. L., & Villanger, Y. Theory Comput. Syst., 59(1):24–51, 2016.
On the Parameterised Complexity of String Morphism Problems [link]Paper  doi  bibtex   
@article{DBLP:journals/mst/FernauSV16,
  author    = {Henning Fernau and
               Markus L. Schmid and
               Yngve Villanger},
  title     = {On the Parameterised Complexity of String Morphism Problems},
  journal   = {Theory Comput. Syst.},
  volume    = {59},
  number    = {1},
  pages     = {24--51},
  year      = {2016},
  url       = {https://doi.org/10.1007/s00224-015-9635-3},
  doi       = {10.1007/s00224-015-9635-3},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/mst/FernauSV16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0