The following pages link to (Q4474102):
Displaying 12 items.
- Order-preserving indexing (Q294954) (← 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)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q5089220) (← links)
- (Q6065422) (← links)
