Adeline Pierrot

18 papers A 1B 1C 1Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings.
Int. J. Approx. Reason.
Pierre Andrieu, Sarah Cohen-Boulakia, Miguel Couceiro, Alain Denise, Adeline Pierrot
2022 J jnl
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations.
Comb. Theory
Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2022 J jnl
Random cographs: Brownian graphon limit and asymptotic degree distribution.
Random Struct. Algorithms
Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2021 J jnl
Efficient, robust and effective rank aggregation for massive biological datasets.
Future Gener. Comput. Syst.
Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2019 — conf
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data.
eScience
Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2018 C conf
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem.
IWOCA
Robin Milosz, Sylvie Hamel, Adeline Pierrot
2017 J jnl
2-Stack Sorting is Polynomial.
Theory Comput. Syst.
Adeline Pierrot, Dominique Rossin
2017 J jnl
An algorithm computing combinatorial specifications of permutation classes.
Discret. Appl. Math.
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015 J jnl
An algorithm computing combinatorial specifications of permutation classes.
CoRR
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015 J jnl
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
Adv. Appl. Math.
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2014 A conf
2-Stack Sorting is polynomial.
STACS
Adeline Pierrot, Dominique Rossin
2013 J jnl
2-Stack Sorting is polynomial
CoRR
Adeline Pierrot, Dominique Rossin
2013 J jnl
2-stack pushall sortable permutations
CoRR
Adeline Pierrot, Dominique Rossin
2013 J jnl
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
CoRR
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2013 B conf
Single and Multiple Consecutive Permutation Motif Search.
ISAAC
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
2013 J jnl
Single and multiple consecutive permutation motif search
CoRR
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
2012 J jnl
Simple permutations poset
CoRR
Adeline Pierrot, Dominique Rossin
2010 J jnl
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
CoRR
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin