Pattern matching for permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Complement reducible graphs
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- Finding pattern matchings for permutations
- Forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- Restricted permutations
- Sorting Using Networks of Queues and Stacks
- Stack sortable permutations
Cited in
(95)- Determinantal formulas for SEM expansions of Schubert polynomials
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
- Longest Common Separable Pattern Among Permutations
- Distributions of statistics on separable permutations
- The minimum number of monotone subsequences
- scientific article; zbMATH DE number 7559423 (Why is no real title available?)
- On Complexity of the Subpattern Problem
- Tree enumeration polynomials on separable permutations
- Order-preserving pattern matching indeterminate strings
- A general exhaustive generation algorithm for Gray structures
- On the growth of the Möbius function of permutations
- Separable \(d\)-permutations and guillotine partitions
- Product decompositions of the symmetric group induced by separable permutations
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- On the number of rectangulations of a planar point set
- Kernelization lower bound for permutation pattern matching
- Separable elements and splittings of Weyl groups
- Finding common structured patterns in linear graphs
- Pattern matching with swaps in practice
- Pattern Matching with Swaps
- Parity permutation pattern matching
- On the topology of the permutation pattern poset
- The Brownian limit of separable permutations
- Generalized coloring of permutations
- On the poset of non-attacking King permutations
- Separable elements in Weyl groups
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
- Generalized Coloring of Permutations
- Constructing separable Arnold snakes of Morse polynomials
- Finding pattern matchings for permutations
- Algorithmic and algebraic aspects of unshuffling permutations
- A counterexample regarding labelled well-quasi-ordering
- Order-preserving indexing
- Order-preserving pattern matching with \(k\) mismatches
- Pattern matching for permutations
- scientific article; zbMATH DE number 1998299 (Why is no real title available?)
- scientific article; zbMATH DE number 2081004 (Why is no real title available?)
- Unsplittable classes of separable permutations
- The Möbius function of separable and decomposable permutations
- Sorting with networks of data structures
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- A linear time algorithm for consecutive permutation pattern matching
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- Combinatorial generation via permutation languages. I: Fundamentals
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
- Permuted Pattern Matching on Multi-track Strings
- Labelled well-quasi-order for permutation classes
- Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
- Grass(mannian) trees and forests: Variations of the exponential formula, with applications to the momentum amplituhedron
- Parity permutation pattern matching
- Computational complexity of counting coincidences
- Operators of equivalent sorting power and related Wilf-equivalences
- On the sub-permutations of pattern avoiding permutations
- scientific article; zbMATH DE number 7640030 (Why is no real title available?)
- Multi-Finger Binary Search Trees
- Finding and counting permutations via CSPs
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- A bijection between permutations and floorplans, and its applications
- The skew Brownian permuton: A new universality class for random constrained permutations
- scientific article; zbMATH DE number 3880704 (Why is no real title available?)
- On the least exponential growth admitting uncountably many closed permutation classes
- On the Brownian separable permuton
- Pattern matching for separable permutations
- Pattern matching for 321-avoiding permutations
- Parallel algorithms for separable permutations
- Combinatorics and algorithms for quasi-chain graphs
- Combinatorics and algorithms for quasi-chain graphs
- The longest common pattern problem for two permutations
- Indexing permutations for binary strings
- Hardness of permutation pattern matching
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
- Boxed permutation pattern matching
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Complete edge-colored permutation graphs
- Permutations encoding the local shape of level curves of real polynomials via generic projections
- The infinite limit of separable permutations
- The permuton limit of random recursive separable permutations
- Sorting by shuffling methods and a queue
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- Enumeration Schemes for Restricted Permutations
- On the sparseness of the downsets of permutations via their number of separators
- Algorithms for testing occurrences of length 4 patterns in permutations
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
- Interval posets of permutations
- A polyominoes-permutations injection and tree-like convex polyominoes
- Improved algorithms for the boxed-mesh permutation pattern matching problem
- On the longest upsequence problem for permutations
- Pattern matching in the cycle structures of permutations
- Unknotted cycles
- The computational landscape of permutation patterns
- Edit distance between unlabeled ordered trees
- An algorithm computing combinatorial specifications of permutation classes
- scientific article; zbMATH DE number 1617282 (Why is no real title available?)
This page was built for publication: Pattern matching for permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293263)
