Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Ahal, S., Rabinovich, Y.: On Complexity of the Subpattern Problem. SIAM J. Discrete Math. 22(2), 629–649 (2008)
2. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
3. Evans, P.: Algorithms and Complexity fo Annotated Sequence Analysis. PhD thesis, University of Victoria, Canada (1999)
4. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science 410(1), 53–61 (2009)
5. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)