30 citations · 63 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011★ 1 cited
A W[1]-Completeness Result for Generalized Permutation Pattern Matching
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…
math.CO2011
A short note on the Stanley-Wilf Conjecture for permutations on multisets
Marie-Louise Bruner
The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct pr…