scientific article; zbMATH DE number 7559423
From MaRDI portal
Publication:5089220
DOI10.4230/LIPIcs.MFCS.2020.52MaRDI QIDQ5089220
Michal Opler, Vít Jelínek, Jakub Pekárek
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2008.04593
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding pattern matchings for permutations
- Pattern matching for permutations
- A fast algorithm for permutation pattern matching based on alternating runs
- Growth rates of geometric grid classes of permutations
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Grid classes and partial well order
- Partially well-ordered closed sets of permutations
- Finding regular insertion encodings for permutation classes
- Profile classes and partial well-order for permutations
- Parallel algorithms for separable permutations
- On the growth of merges and staircases of permutation classes
- The insertion encoding of permutations
- On the longest upsequence problem for permutations
- Geometric grid classes of permutations
- Small permutation classes
- Pattern Matching for 321-Avoiding Permutations
- Hardness of Permutation Pattern Matching
- Automatic discovery of structural rules of permutation classes
- Growth rates of permutation classes: from countable to uncountable
- Generalized Coloring of Permutations
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- Finding small patterns in permutations in linear time
This page was built for publication:
