Parity permutation pattern matching

DOI10.1007/978-3-031-27051-2_32MaRDI QIDQ6070786

Stéphane Vialette, Virginia Ardévol Martínez, Florian Sikora

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

zbMATH Keywords

fixed parameter tractabilityNP-hardnessparameterized hardness\textsc{permutation pattern matching}

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching for permutations
• A fast algorithm for permutation pattern matching based on alternating runs
• Patterns in permutations and words.
• Finding and counting permutations via CSPs
• Combinatorics of the group of parity alternating permutations
• The computational landscape of permutation patterns
• On Complexity of the Subpattern Problem
• Pattern Matching for 321-Avoiding Permutations
• The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
• Hardness of Permutation Pattern Matching
• Twin-width I: Tractable FO Model Checking
• Finding small patterns in permutations in linear time
• Parameterized Algorithms
• Restricted Grassmannian permutations

This page was built for publication: Parity permutation pattern matching