Pages that link to "Item:Q3629466"
From MaRDI portal
The following pages link to On Complexity of the Subpattern Problem (Q3629466):
Displayed 9 items.
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q6065422) (← links)
- Parity permutation pattern matching (Q6070786) (← links)