The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Pattern matching for permutations
Information Processing Letters
A fast algorithm for computing longest common subsequences
Communications of the ACM
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Algorithms for Pattern Involvement in Permutations
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Combinatorics of Permutations
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Excluded permutation matrices and the Stanley-Wilf conjecture
Journal of Combinatorial Theory Series A
On Complexity of the Subpattern Problem
SIAM Journal on Discrete Mathematics
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A fast algorithm for permutation pattern matching based on alternating runs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
Given two permutations 驴 and 驴, the NP-complete Permutation Pattern problem is to decide whether 驴 contains 驴 as a pattern. In case both 驴 and 驴 are 321-avoiding, we prove the Permutation Pattern problem to be solvable in O(k 2 n 6) time, where k = |驴| and n = |驴|, and give a $O(kn^{4\sqrt{k}+12})$ time algorithm if only 驴 is 321-avoiding. Finally, we show W[1]-hardness of a 2-colored version of this latter problem.