Publications

Preprints

  1. Two first-order logics of permutations.
    With Michael Albert and Valentin Feray.
    ArXiv

  2. Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers.
    With Nick Beaton, Veronica Guerrini and Simone Rinaldi.
    ArXiv

  3. Some families of trees arising in permutation analysis.
    With Marni Mishna and Cyril Nicaud.
    ArXiv
    The Maple worksheets associated with this paper.

  4. Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences.
    With Nick Beaton, Veronica Guerrini and Simone Rinaldi.
    ArXiv
    The Mathematica worksheet associated with this paper. It makes use of Manuel Kauers' Guess package, available here .

Journals

  1. Universal limits of substitution-closed permutation classes.
    With Frédérique Bassino, Valentin Féray, Lucas Gerin, Mickaël Maazoun and Adeline Pierrot.
    ArXiv
    Accepted for publication in the Journal of the European Mathematical Society (JEMS)

  2. Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence.
    With Veronica Guerrini, Andrew Rechnitzer and Simone Rinaldi
    ArXiv
    Accepted for publication in the SIAM Journal on Discrete Mathematics (SIDMA).
    The Maple worksheet associated with this paper.

  3. The Brownian limit of separable permutations.
    With Frédérique Bassino, Valentin Féray, Lucas Gerin and Adeline Pierrot.
    Annals of Probability, vol. 46(4), 2018.
    ArXiv, Annals of Probability (via Project Euclid)
    A five-page abstract for Permutation Patterns 2016.

  4. An algorithm computing combinatorial specifications of permutation classes.
    With Frédérique Bassino, Adeline Pierrot, Carine Pivoteau and Dominique Rossin.
    Discrete Applied Mathematics, vol. 224, 2017.
    ArXiv, Discrete Applied Mathematics
    Some Maple worksheets associated with this paper.

  5. Permutation classes and polyomino classes with excluded submatrices.
    With Daniela Battaglino, Andrea Frosini and Simone Rinaldi.
    Mathematical Structures in Computer Science (Cambridge University Press), 2015.
    ArXiv, Mathematical Structures in Computer Science

  6. A general theory of Wilf-equivalence for Catalan structures.
    With Michael Albert.
    Electronic Journal of Combinatorics, vol. 22(4), Paper P4.45, 2015.
    ArXiv, Electronic Journal of Combinatorics

  7. An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
    With Frédérique Bassino, Adeline Pierrot and Dominique Rossin.
    Advances in Applied Mathematics, vol. 64, 2015.
    ArXiv, Advances in Applied Mathematics

  8. Operators of equivalent sorting power and related Wilf-equivalences.
    With Michael Albert.
    Electronic Journal of Combinatorics, vol. 21(4), Paper P4.11, 2014.
    ArXiv, Electronic Journal of Combinatorics

  9. Combinatorics of non-ambiguous trees.
    With Jean-Christophe Aval, Adrien Boussicault and Matteo Silimbani.
    Advances in Applied Mathematics, vol. 56, 2014.
    ArXiv, Advances in Applied Mathematics

  10. Refined enumeration of permutations sorted with two stacks and a D8-symmetry.
    With Olivier Guibert.
    Annals of Combinatorics, vol. 18(2), 2014.
    ArXiv, Annals of Combinatorics

  11. Geometric grid classes of permutations.
    With Michael H. Albert, Mike D. Atkinson, Nik Ruskuc and Vincent Vatter
    Transactions of the American Mathematical Society, vol. 365(11), 2013.
    ArXiv, TAMS

  12. On the enumeration of d-minimal permutations.
    With Luca Ferrari.
    Discrete Mathematics and Theoretical Computer Science, vol. 15(2), 2013.
    ArXiv, DMTCS

  13. On the inverse image of pattern classes under bubble sort.
    With Michael H. Albert, Mike D. Atkinson, Anders Claesson and Mark Dukes.
    Journal of Combinatorics, vol. 2(2), 2011.
    ArXiv, JOC

  14. Average-case analysis of perfect sorting by reversals.
    With Cédric Chauve, Marni Mishna and Dominique Rossin.
    Discrete Mathematics, Algorithms and Applications, vol. 3(3), 2011.
    ArXiv, DMAA

  15. Enumeration of Pin-Permutations.
    With Frédérique Bassino and Dominique Rossin.
    Electronic Journal of Combinatorics, vol. 18(1), 2011.
    EJC

  16. Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial.
    With Frédérique Bassino, Adeline Pierrot and Dominique Rossin.
    Pure Mathematics and Applications vol. 21(2), 2010.
    ArXiv, PuMA

  17. Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents.
    With Elisa Pergola.
    Theoretical Computer Science, vol. 411(26-28), 2010.
    ArXiv, TCS

  18. A variant of the tandem duplication-random loss model of genome rearrangement.
    With Dominique Rossin.
    Theoretical Computer Science, vol. 410(8-10), 2009.
    ArXiv, TCS

  19. Posets and Permutations in the duplication-loss model.
    With Elisa Pergola.
    Pure Mathematics and Applications, vol. 19(2-3), 2008
    PuMA

  20. Some statistics on permutations avoiding generalized patterns.
    With Antonio Bernini and Luca Ferrari
    Pure Mathematics and Applications, vol. 18(3-4), 2007
    ArXiv, PuMA

  21. The Longest Common Pattern Problem for two Permutations.
    With Dominique Rossin
    Pure Mathematics and Applications, vol. 17(1-2), 2006.
    PuMA

Conferences with proceedings

(Arxiv links are often to long versions of papers of which an extended abstract was published in the corresponding conference proceedings.)
  1. Analysis of Algorithms for Permutations Biased by Their Number of Records.
    With Nicolas Auger, Cyril Nicaud and Carine Pivoteau.
    Analysis of Algorithms 2016 (Krakow, Poland).
    Proceedings published electronically.
    ArXiv, Proceedings

  2. Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled.
    With Veronica Guerrini and Simone Rinaldi.
    FPSAC 2016 (28th International Conference on Formal Power Series and Algebraic Combinatorics,Vancouver, Canada).
    DMTCS proceedings, vol. BC, 2016.
    ArXiv, Proceedings

  3. Operators of equivalent sorting power and related Wilf-equivalences.
    With Michael Albert.
    FPSAC 2013 (25th International Conference on Formal Power Series and Algebraic Combinatorics, Paris, France).
    DMTCS proceedings, vol. AS, 2013.
    ArXiv, DMTCS

  4. Combinatorics of non-ambiguous trees.
    With Jean-Christophe Aval, Adrien Boussicault and Matteo Silimbani.
    FPSAC 2013 (25th International Conference on Formal Power Series and Algebraic Combinatorics, Paris, France).
    DMTCS proceedings, vol. AS, 2013.
    ArXiv, DMTCS

  5. Some simple varieties of trees arising in permutation analysis.
    With Marni Mishna and Cyril Nicaud.
    FPSAC 2013 (25th International Conference on Formal Power Series and Algebraic Combinatorics, Paris, France).
    DMTCS proceedings, vol. AS, 2013.
    ArXiv, DMTCS

  6. Enumeration of permutations sorted with two passes through a stack and D8-symmetries.
    With Olivier Guibert.
    FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics, Nagoya, Japan)
    DMTCS proceedings, vol. AR, 2012.
    ArXiv, DMTCS

  7. Combinatorial specification of permutation classes.
    With Frédérique Bassino, 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.
    ArXiv, DMTCS

  8. Average-case analysis of perfect sorting by reversals.
    With Cédric Chauve, Marni Mishna and Dominique Rossin.
    Combinatorial Pattern Matching, 20th Annual Symposium, 2009.
    Lecture Notes in Computer Science, vol. 5577, 2009.
    ArXiv, LNCS

  9. Longest Common Separable Pattern between Permutations.
    With Dominique Rossin and Stéphane Vialette.
    Combinatorial Pattern Matching, 18th Annual Symposium, 2007.
    Lecture Notes in Computer Science, vol. 4580, 2007.
    ArXiv, LNCS

  10. Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey.
    With Vladimir Grebinski and Gregory Kucherov
    WG, 31st International Workshop on Graph-Theoretic Concepts in Computer Science, 2005.
    Lecture Notes in Computer Science, vol. 3787, 2005.
    LNCS

Mémoires (en français)

  1. Quelques problèmes combinatoires et algorithmiques sur les classes de permutations.
    Thèse sous la direction de Dominique Rossin et Renzo Pinzani, soutenue le 4 décembre 2009 à Paris.
    Manuscrit.

  2. Autour des permutations séparables.
    Stage au LIAFA, encadré par Dominique Rossin.
    Rapport de stage.

  3. Recherche combinatoire de graphes.
    Stage au LORIA, encadré par Gregory Kucherov.
    Rapport de stage.

  4. Enumération des permutations à motif exclu.
    Stage au DSI de Florence, encadré par Renzo Pinzani.
    Rapport de stage.

Ouvrages collectifs (en français)

  1. Maths la Terminale S, Objectif Mention Très Très Bien en 24 Problemes Corrigés.
    Aux éditions Ellipse.
    Il s'agit d'un recueil de problèmes corrigés pour approfondir le programme du lycée, qui est très fortement inspiré des "fiches" créées pour la colonie Mat'les vacances.
    Le livre sur Amazon.

Conferences without proceedings

This section is not maintained anymore. Please visit my presentation page for slides instead.
  1. Refined enumeration of permutations sorted with two stacks and a D8-symmetry.
    With Olivier Guibert.
    Permutation Patterns 2012
    ArXiv

  2. The bubble sort operator.
    With Michael Albert, Mike Atkinson, Anders Claesson and Mark Dukes.
    Permutation Patterns 2011
    ArXiv

  3. On the enumeration of d-minimal permutations.
    With Luca Ferrari.
    Permutation Patterns 2011
    ArXiv

  4. A polynomial algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
    With Frédérique Bassino, Adeline Pierrot and Dominique Rossin.
    Permutation Patterns 2010.
    pdf

  5. Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial.
    With Frédérique Bassino, Adeline Pierrot and Dominique Rossin
    Permutation Patterns 2009.
    pdf

  6. Posets and Permutations in the duplication-loss model.
    With Elisa Pergola
    Conference Génération aléatoire de structures combinatoires (GASCom), 2008.
    pdf

  7. A variant of the tandem duplication - random loss model of genome rearrangement.
    With Dominique Rossin.
    Permutation Patterns 2007.
    pdf

  8. Some Statistics on Permutations Avoiding Generalized Patterns.
    With Antonio Bernini and Luca Ferrari.
    Conference Génération aléatoire de structures combinatoires (GASCom), 2006.
    ArXiv