Pages that link to "Item:Q5383966"
From MaRDI portal
The following pages link to Finding small patterns in permutations in linear time (Q5383966):
Displaying 20 items.
- Order-preserving indexing (Q294954) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- On the structure of matrices avoiding interval-minor patterns (Q1795489) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- (Q5089220) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- (Q6065422) (← links)
- Improved algorithm for permutation testing (Q6138826) (← links)
- Strongly sublinear algorithms for testing pattern freeness (Q6566461) (← links)
- Generalized coloring of permutations (Q6582372) (← links)
- Parity permutation pattern matching (Q6586663) (← links)
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024 (Q6613409) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
