Adeline Pierrot

From MaRDI portal
(Redirected from Person:526813)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Scaling limit of graph classes through split decomposition
The Australasian Journal of Combinatorics
2025-10-21Paper
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
International Journal of Approximate Reasoning
2023-11-16Paper
Random cographs: Brownian graphon limit and asymptotic degree distribution
Random Structures & Algorithms
2023-10-12Paper
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Combinatorial Theory
2022-11-23Paper
Scaling limit of graph classes through split decomposition2022-07-25Paper
Scaling limits of permutation classes with a finite specification: a dichotomy
Advances in Mathematics
2022-07-15Paper
Universal limits of substitution-closed permutation classes
Journal of the European Mathematical Society (JEMS)
2020-12-17Paper
Combinatorial specification of permutation classes2019-05-24Paper
Combinatorial specification of permutation classes
(available as arXiv preprint)
2019-05-24Paper
Scaling limits of permutation classes with a finite specification: a dichotomy
(available as arXiv preprint)
2019-03-18Paper
Median of 3 permutations, 3-cycles and 3-hitting set problem2018-09-06Paper
The Brownian limit of separable permutations
The Annals of Probability
2018-08-16Paper
The Brownian limit of separable permutations
The Annals of Probability
2018-08-16Paper
2-stack sorting is polynomial
Theory of Computing Systems
2017-07-17Paper
An algorithm computing combinatorial specifications of permutation classes
Discrete Applied Mathematics
2017-05-15Paper
2-stack sorting is polynomial
(available as arXiv preprint)
2017-03-03Paper
Adjacent transformations in permutations2017-02-10Paper
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Advances in Applied Mathematics
2015-02-06Paper
Single and multiple consecutive permutation motif search
Algorithms and Computation
2014-01-14Paper
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
PU.M.A. Pure Mathematics and Applications
2012-09-18Paper
Dense and nondense limits for uniform random intersection graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Adeline Pierrot