32 citations · 51 across the 11 of their papers we have counts for
4 papers · 1 filter
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…
Single and multiple consecutive permutation motif search
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot +1
Let be a permutation (that shall play the role of the {\em text}) on and a pattern be a sequence of distinct integer(s) of , . The pattern occur…