Author:
Manea Florin,Nowotka Dirk,Schmid Markus L.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer International Publishing AG, Cham (2015)
2. Da̧browski, R., Plandowski, W.: Solving two-variable word equations. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 408–419. Springer, Heidelberg (2004)
3. Fernau, H., Manea, F., Mercaş, R., Schmid, M.L.: Pattern matching with variables: fast algorithms and new hardness results. In: Proceedings of 32nd Symposium on Theoretical Aspects of Computer Science, STACS 2015, Leibniz International Proceedings in Informatics (LIPIcs), vol. 30, pp. 302–315 (2015)
4. Fernau, H., Schmid, M.L.: Pattern matching with variables: a multivariate complexity analysis. Inf. Comput. 242, 287–305 (2015)
5. Fernau, H., Schmid, M.L., Villanger, Y.: On the parameterised complexity of string morphism problems. Theory of Computing Systems (2015). http://dx.doi.org/10.1007/s00224-015-9635-3
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献