scientific article; zbMATH DE number 7559423

DOI10.4230/LIPICS.MFCS.2020.52MaRDI QIDQ5089220zbMATH OpenFDO

Authors Vít Jelínek, Michal Opler, Jakub Pekárek

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/2008.04593

zbMATH Keywords

grid classespattern matchingpermutations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Automatic discovery of structural rules of permutation classes
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Finding pattern matchings for permutations
• Finding regular insertion encodings for permutation classes
• Finding small patterns in permutations in linear time
• Generalized Coloring of Permutations
• Geometric grid classes of permutations
• Grid classes and partial well order
• Growth rates of geometric grid classes of permutations
• Growth rates of permutation classes: from countable to uncountable
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• Hardness of permutation pattern matching
• scientific article; zbMATH DE number 1617282 (Why is no real title available?)
• scientific article; zbMATH DE number 2081004 (Why is no real title available?)
• On the growth of merges and staircases of permutation classes
• On the longest upsequence problem for permutations
• Parallel algorithms for separable permutations
• Partially well-ordered closed sets of permutations
• Pattern matching for 321-avoiding permutations
• Pattern matching for permutations
• Permutation pattern matching in (213,231)-avoiding permutations
• Profile classes and partial well-order for permutations
• Small permutation classes
• The insertion encoding of permutations

Cited in

(2)

• A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
• Generalized coloring of permutations

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 Q5089220)