30 citations · 63 across the 9 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2013★ 15 cited
The computational landscape of permutation patterns
Marie-Louise Bruner, Martin Lackner
In the last years, different types of patterns in permutations have been studied: vincular, bivincular and mesh patterns, just to name a few. Every type of permutation pattern natu…
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…