1. On complexity of the subpattern problem;Ahal;SIAM J. Discrete Math.,2008
2. On problems without polynomial kernels;Bodlaender;J. Comput. Syst. Sci.,2009
3. Cross-composition: a new technique for kernelization lower bounds;Bodlaender,2011
4. The computational landscape of permutation patterns;Bruner;Pure Math. Appl.,2013
5. A fast algorithm for permutation pattern matching based on alternating runs;Bruner,2012