The following pages link to Dominique Rossin (Q394356):
Displaying 19 items.
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths (Q394358) (← links)
- Counting \(k\)-convex polyominoes (Q396773) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Enumeration of pin-permutations (Q540037) (← links)
- A variant of the tandem duplication-random loss model of genome rearrangement (Q1006059) (← links)
- On the sandpile group of dual graphs (Q1568782) (← links)
- Polynomial ideals for sandpiles and their Gröbner bases (Q1605301) (← links)
- On the identity of the sandpile group (Q1849983) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- 2-stack sorting is polynomial (Q2363966) (← links)
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) (← links)
- (Q2915601) (← links)
- (Q2960003) (← links)
- 2-Stack Sorting is polynomial (Q2965521) (← links)
- (Q3077256) (← links)
- (Q3077257) (← links)
- (Q3154667) (← links)
- (Q3154686) (← links)
- Edit distance between unlabeled ordered trees (Q3423140) (← links)
