Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (CoRR, 2010)

Simple permutations poset - Adeline Pierrot; Dominique Rossin (CoRR, 2012)

Single and Multiple Consecutive Permutation Motif Search. - Djamal Belazzougui; Adeline Pierrot; Mathieu Raffinot; Stéphane Vialette (ISAAC, 2013)

2-stack pushall sortable permutations - Adeline Pierrot; Dominique Rossin (CoRR, 2013)

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (Adv. Appl. Math., 2015)

An algorithm computing combinatorial specifications of permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Carine Pivoteau; Dominique Rossin (Discret. Appl. Math., 2017)

2-Stack Sorting is Polynomial. - Adeline Pierrot; Dominique Rossin (Theory Comput. Syst., 2017)

Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem. - Robin Milosz; Sylvie Hamel; Adeline Pierrot (IWOCA, 2018)

Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. - Pierre Andrieu; Bryan Brancotte; Laurent Bulteau; Sarah Cohen-Boulakia; Alain Denise; Adeline Pierrot; Stéphane Vialette (eScience, 2019)

Efficient, robust and effective rank aggregation for massive biological datasets. - Pierre Andrieu; Bryan Brancotte; Laurent Bulteau; Sarah Cohen-Boulakia; Alain Denise; Adeline Pierrot; Stéphane Vialette (Future Gener. Comput. Syst., 2021)

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. - Frédérique Bassino; Mathilde Bouvel; Michael Drmota; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Comb. Theory, 2022)

Random cographs: Brownian graphon limit and asymptotic degree distribution. - Frédérique Bassino; Mathilde Bouvel; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Random Struct. Algorithms, 2022)

A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings. - Pierre Andrieu; Sarah Cohen-Boulakia; Miguel Couceiro; Alain Denise; Adeline Pierrot (Int. J. Approx. Reason., 2023)