21 citations · 30 across the 11 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
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.…
math.CO2013
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…