21 citations · 30 across the 11 of their papers we have counts for
14 papers
An algorithm computing combinatorial specifications of permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2
This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple…
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1
In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations.…
2-Stack Sorting is polynomial
Adeline Pierrot, Dominique Rossin
In this article, we give a polynomial algorithm to decide whether a given permutation is sortable with two stacks in series. This is indeed a longstanding open problem which wa…
2-stack pushall sortable permutations
Adeline Pierrot, Dominique Rossin
In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if…
Combinatorial bijections from hatted avoiding permutations in to generalized Dyck and Motzkin paths
Phan Thuan Do, Dominique Rossin, Thi Thu Huong Tran
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of…
Combinatorial specification of permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2
This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set…