Journal

  • Universal limits of substitution-closed permutation classes.

    Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun and Adeline Pierrot.
    Accepted for publication in the Journal of the European Mathematical Society (JEMS).
    ArXiv

  • The Brownian limit of separable permutations.

    Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot.
    Annals of Probability, vol. 46(4), 2018.
    ArXiv, Annals of Probability

  • An algorithm computing combinatorial specifications of permutation classes.

    Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau and Dominique Rossin.
    Discrete Applied Mathematics, vol. 224, 2017.
    ArXiv, Discrete Applied Mathematics

  • 2-Stack Sorting is polynomial.

    Adeline Pierrot and Dominique Rossin.
    Journal Theory of Computing Systems, vol. 60(3), 2017.
    ArXiv, Theory of Computing Systems

  • An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.

    Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot and Dominique Rossin.
    Advances in Applied Mathematics, vol. 64, 2015.
    ArXiv, Advances in Applied Mathematics

  • 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 and Dominique Rossin.
    Pure Mathematics and Applications, vol. 21(2), 2010.
    ArXiv, Pure Mathematics and Applications


Conferences

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

    Robin Milosz, Sylvie Hamel and Adeline Pierrot.
    IWOCA 2018 (29th International Workshop on Combinatorial Algorithms, Singapore)
    Lecture Notes in Computer Science, vol. 10979, 2018
    Proceedings

  • 2-Stack Sorting is polynomial.

    Adeline Pierrot and Dominique Rossin.
    STACS 2014 (31st International Symposium on Theoretical Aspects of Computer Science, Lyon)
    Leibniz International Proceedings in Informatics (LIPIcs), vol. 25, 2014
    Proceedings

  • Single and multiple consecutive permutation motif search.

    Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot and Stéphane Vialette.
    ISAAC 2013 (24th International Symposium on Algorithms and Computation, Hong Kong)
    Lecture Notes in Computer Science, vol. 8283, 2013
    Proceedings, pdf

  • Combinatorial specification of permutation classes.

    Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau and Dominique Rossin.
    FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics, Nagoya, Japan)
    DMTCS proceedings, vol. AR, 2012.
    Proceedings

  • Adjacent transformations in permutations.

    Adeline Pierrot, Dominique Rossin and Julian West.
    FPSAC 2011 (23th International Conference on Formal Power Series and Algebraic Combinatorics, Reykjavik, Iceland)
    DMTCS proceedings, vol. AO, 2011.
    Proceedings


Thesis



Preprints

  • 2-Stack pushall sortable permutations.

    Adeline Pierrot and Dominique Rossin.
    ArXiv (41p.)

  • Single and multiple consecutive permutation motif search.

    Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot and Stéphane Vialette.
    ArXiv (19p.)

  • Simple permutations poset.

    Adeline Pierrot and Dominique Rossin.
    ArXiv (15p.)