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

{"_id":"TiStKN6tKWsHhagAP","bibbaseid":"fernau-schmid-villanger-ontheparameterisedcomplexityofstringmorphismproblems-2013","downloads":0,"creationDate":"2018-10-01T13:54:48.760Z","title":"On the Parameterised Complexity of String Morphism Problems","author_short":["Fernau, H.","Schmid, M. L.","Villanger, Y."],"year":2013,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/f/HenningFernau.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","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","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","bibtex":"@inproceedings{DBLP:conf/fsttcs/FernauSV13,\n author = {Henning Fernau and\n Markus L. Schmid and\n Yngve Villanger},\n title = {On the Parameterised Complexity of String Morphism Problems},\n booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and\n Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013,\n Guwahati, India},\n pages = {55--66},\n year = {2013},\n crossref = {DBLP:conf/fsttcs/2013},\n url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.55},\n doi = {10.4230/LIPIcs.FSTTCS.2013.55},\n timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/conf/fsttcs/FernauSV13},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fernau, H.","Schmid, M. L.","Villanger, Y."],"key":"DBLP:conf/fsttcs/FernauSV13","id":"DBLP:conf/fsttcs/FernauSV13","bibbaseid":"fernau-schmid-villanger-ontheparameterisedcomplexityofstringmorphismproblems-2013","role":"author","urls":{"Paper":"https://doi.org/10.4230/LIPIcs.FSTTCS.2013.55"},"downloads":0},"search_terms":["parameterised","complexity","string","morphism","problems","fernau","schmid","villanger"],"keywords":[],"authorIDs":[],"dataSources":["TuA7fGR5JYLK4NXQn"]}