The following pages link to Pattern matching for permutations (Q5060113):
Displaying 20 items.
- Finding pattern matchings for permutations (Q290212) (← links)
- Pattern matching for permutations (Q293263) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Some considerations on permutation trees (Q799671) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- Permutations with one or two 132-subsequences (Q1381862) (← links)
- Pattern matching for separable permutations (Q1796851) (← links)
- The minimum number of monotone subsequences (Q1856066) (← links)
- On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) (Q1970072) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- The complexity of counting poset and permutation patterns (Q2800773) (← links)
- Pattern matching with swaps in practice (Q2909198) (← links)
- Pattern matching in the cycle structures of permutations (Q2915622) (← links)
- Permuted Pattern Matching on Multi-track Strings (Q2927653) (← links)
- Pattern Matching with Swaps (Q4521515) (← links)
- Order Preserving Pattern Matching on Trees and DAGs (Q5150939) (← links)
- Finding and Counting Permutations via CSPs (Q5875533) (← links)
- Restricted permutations (Q5906401) (← links)
- Parity permutation pattern matching (Q6070786) (← links)
