Finding and counting permutations via CSPs
From MaRDI portal
Publication:2041985
DOI10.1007/s00453-021-00812-zOpenAlexW3133527322MaRDI QIDQ2041985
László Kozma, Dániel Marx, Benjamin Aram Berendsohn
Publication date: 26 July 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04673
Related Items
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ Parity permutation pattern matching
Uses Software
Cites Work
- Finding pattern matchings for permutations
- Pattern matching for permutations
- A fast algorithm for permutation pattern matching based on alternating runs
- Permutations sortable by two stacks in parallel and quarter plane walks
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Patterns in permutations and words.
- On two techniques of combining branching and treewidth
- Pathwidth of cubic graphs and exact algorithms
- Tree clustering for constraint networks
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- A partial k-arboretum of graphs with bounded treewidth
- A survey of stack-sorting disciplines
- Pattern matching for \(k\)-track permutations
- Generating permutations with restricted containers
- Parallel algorithms for separable permutations
- On a unimodal sequence of binomial coefficients
- Bounds for the growth rate of meander numbers
- The computational landscape of permutation patterns
- Permutation classes
- Self-Adjusting Binary Search Trees: What Makes Them Tick?
- On Complexity of the Subpattern Problem
- Pattern Matching for 321-Avoiding Permutations
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- Estimating the Efficiency of Backtrack Programs
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
- Hardness of Permutation Pattern Matching
- Testing for Forbidden Order Patterns in an Array
- Hitting Set for hypergraphs of low VC-dimension
- Improved Bounds for Testing Forbidden Order Patterns
- Sorting jordan sequences in linear time using level-linked search trees
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions.
- Fast Sorting and Pattern-Avoiding Permutations
- Structure of Graphs with Locally Restricted Crossings
- Finding small patterns in permutations in linear time
- Sorting Using Networks of Queues and Stacks
- Restricted permutations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
