scientific article; zbMATH DE number 2081004
From MaRDI portal
Publication:4474102
Recommendations
Cited in
(19)- Alternative developments of cyclic-permutation algorithms
- Algorithms for testing occurrences of length 4 patterns in permutations
- Algorithmic and algebraic aspects of unshuffling permutations
- Pattern matching for separable permutations
- On the least exponential growth admitting uncountably many closed permutation classes
- Finding and counting permutations via CSPs
- An algebraic approach for the search space of permutations with repetition
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
- Single and multiple consecutive permutation motif search
- Order-preserving indexing
- A linear time algorithm for consecutive permutation pattern matching
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
- On the sub-permutations of pattern avoiding permutations
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Pattern matching for permutations
- scientific article; zbMATH DE number 7559423 (Why is no real title available?)
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Strongly sublinear algorithms for testing pattern freeness
- Some considerations on permutation trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474102)
