Marie-Louise Lackner

Learn More
The PERMUTATION PATTERN MATCHING problem, asking whether a pattern permutation π is contained in a permutation τ, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases. The first algorithm is applicable if both π and τ are 321-avoiding; the second is applicable if π and τ are skew-merged. Both algorithms have(More)
  • 1