82 citations · 351 across the 32 of their papers we have counts for
1 paper · 1 filter
Marie-Louise Bruner, Martin Lackner
The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving em…