Paper  doi  bibtex   

@inproceedings{DBLP:conf/fsttcs/FernauSV13,
  author    = {Henning Fernau and
               Markus L. Schmid and
               Yngve Villanger},
  title     = {On the Parameterised Complexity of String Morphism Problems},
  booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013,
               Guwahati, India},
  pages     = {55--66},
  year      = {2013},
  crossref  = {DBLP:conf/fsttcs/2013},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.55},
  doi       = {10.4230/LIPIcs.FSTTCS.2013.55},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/FernauSV13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}