@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}
}

{"_id":"Ry8MFKBt6zjJdtene","bibbaseid":"fernau-schmid-villanger-ontheparameterisedcomplexityofstringmorphismproblems-2016","downloads":0,"creationDate":"2018-10-01T13:54:48.705Z","title":"On the Parameterised Complexity of String Morphism Problems","author_short":["Fernau, H.","Schmid, M. L.","Villanger, Y."],"year":2016,"bibtype":"article","biburl":"https://dblp.org/pid/f/HenningFernau.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Henning"],"propositions":[],"lastnames":["Fernau"],"suffixes":[]},{"firstnames":["Markus","L."],"propositions":[],"lastnames":["Schmid"],"suffixes":[]},{"firstnames":["Yngve"],"propositions":[],"lastnames":["Villanger"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/mst/FernauSV16,\n author = {Henning Fernau and\n Markus L. Schmid and\n Yngve Villanger},\n title = {On the Parameterised Complexity of String Morphism Problems},\n journal = {Theory Comput. Syst.},\n volume = {59},\n number = {1},\n pages = {24--51},\n year = {2016},\n url = {https://doi.org/10.1007/s00224-015-9635-3},\n doi = {10.1007/s00224-015-9635-3},\n timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/mst/FernauSV16},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fernau, H.","Schmid, M. L.","Villanger, Y."],"key":"DBLP:journals/mst/FernauSV16","id":"DBLP:journals/mst/FernauSV16","bibbaseid":"fernau-schmid-villanger-ontheparameterisedcomplexityofstringmorphismproblems-2016","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00224-015-9635-3"},"downloads":0},"search_terms":["parameterised","complexity","string","morphism","problems","fernau","schmid","villanger"],"keywords":[],"authorIDs":[],"dataSources":["TuA7fGR5JYLK4NXQn"]}