Journal

  • 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, PuMA

Conferences

  • 2-Stack Sorting is polynomial.

    Adeline Pierrot and Dominique Rossin.
    STACS 2014 (31st International Symposium on Theoretical Aspects of Computer Science, Lyon) Conference webpage, pdf

  • 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) Conference webpage, 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.
    DMTCS

  • 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.
    DMTCS

Thesis

Preprints

  • 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.
    ArXiv (68p.)

  • 2-Stack pushall sortable permutations.

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

  • 2-Stack Sorting is polynomial.

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

  • 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.)