Adeline Pierrot

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 7

Top Topics

Preferential Attachment

Biological Data

Execution Times

Top Venues

Int. J. Approx. Reason.

Future Gener. Comput. Syst.

Publications

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