Adeline Pierrot

According to our database, Adeline Pierrot authored at least 12 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

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., November, 2023

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

2021

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

2019

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

Proceedings of the 15th International Conference on eScience, 2019

2018

Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem.

Robin Milosz, Sylvie Hamel, Adeline Pierrot

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

2-Stack Sorting is Polynomial.

Adeline Pierrot, Dominique Rossin

Theory Comput. Syst., 2017

An algorithm computing combinatorial specifications of permutation classes.

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin

Discret. Appl. Math., 2017

2015

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

2013

2-stack pushall sortable permutations

Adeline Pierrot, Dominique Rossin

CoRR, 2013

Single and Multiple Consecutive Permutation Motif Search.

Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Simple permutations poset

Adeline Pierrot, Dominique Rossin

CoRR, 2012

2010

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