Finding and counting permutations via CSPs
From MaRDI portal
Publication:2041985
Recommendations
- Finding and Counting Permutations via CSPs
- The complexity of counting poset and permutation patterns
- On exact algorithms for the permutation CSP
- Counting solutions to CSP using generating polynomials
- Computable permutations and word problems
- Counting fixed-length permutation patterns
- Counting permutations by numbers of excedances, fixed points and cycles
- Counting and generating permutations in regular classes
- Counting Pop-Stacked Permutations in Polynomial Time
- scientific article; zbMATH DE number 91009
Cites work
- scientific article; zbMATH DE number 3877182 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 2081004 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- A partial k-arboretum of graphs with bounded treewidth
- A survey of stack-sorting disciplines
- A walk through combinatorics. An introduction to enumeration and graph theory
- Bounds for the growth rate of meander numbers
- Can you beat treewidth?
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- Estimating the Efficiency of Backtrack Programs
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Fast Sorting and Pattern-Avoiding Permutations
- Finding pattern matchings for permutations
- Finding small patterns in permutations in linear time
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- Generating permutations with restricted containers
- Hardness of permutation pattern matching
- Hitting Set for hypergraphs of low VC-dimension
- Improved bounds for testing forbidden order patterns
- Improving TSP tours using dynamic programming over tree decompositions
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- On Complexity of the Subpattern Problem
- On a unimodal sequence of binomial coefficients
- On two techniques of combining branching and treewidth
- Parallel algorithms for separable permutations
- Pathwidth of cubic graphs and exact algorithms
- Pattern matching for 321-avoiding permutations
- Pattern matching for \(k\)-track permutations
- Pattern matching for permutations
- Patterns in permutations and words.
- Permutation classes
- Permutation pattern matching in \((213,231)\)-avoiding permutations
- Permutations sortable by two stacks in parallel and quarter plane walks
- Restricted permutations
- Self-adjusting binary search trees: what makes them tick?
- Sorting Using Networks of Queues and Stacks
- Sorting jordan sequences in linear time using level-linked search trees
- Structure of graphs with locally restricted crossings
- Testing for forbidden order patterns in an array
- The complexity of pattern matching for 321-avoiding and skew-merged permutations
- The computational landscape of permutation patterns
- Tree clustering for constraint networks
Cited in
(14)- Parity permutation pattern matching
- On exact algorithms for the permutation CSP
- Algorithms for testing occurrences of length 4 patterns in permutations
- Finding and counting permutations via CSPs
- Finding and Counting Permutations via CSPs
- The complexity of counting poset and permutation patterns
- Parity permutation pattern matching
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- scientific article; zbMATH DE number 1617282 (Why is no real title available?)
- Counting and Generating Permutations Using Timed Languages
- scientific article; zbMATH DE number 91009 (Why is no real title available?)
- Finding small patterns in permutations in linear time
- Strongly sublinear algorithms for testing pattern freeness
- Permutation patterns are hard to count
This page was built for publication: Finding and counting permutations via CSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2041985)
