Publications

Preprints

Enumeration of pattern-avoiding alternating sign matrices: An asymptotic dichotomy.
With Eric S. Egge, Rebecca N. Smith, Jessica Striker and Justin M. Troyka.
ArXiv

Record-biased permutations and their permuton limit.
With Cyril Nicaud and Carine Pivoteau.
ArXiv

Key-avoidance for alternating sign matrices .
With Rebecca Smith and Jessica Striker.
ArXiv

Between weak and Bruhat: the middle order on permutations .
With Luca Ferrari and Bridget E. Tenner.
ArXiv

A canonical tree decomposition for order types, and some applications.
With Valentin Féray, Florent Koechlin and Xavier Goaoc.
ArXiv
(An extended abstract of this paper has been accepted for a talk presentation in SoCG 2024. The proceedings are available from LipiCS. )

Dense and nondense limits for uniform random intersection graphs.
With Frédérique Bassino, Valentin Féray, Lucas Gerin and Adeline Pierrot.
ArXiv

Scaling limit of graph classes through split decomposition.
With Frédérique Bassino, Valentin Féray, Lucas Gerin and Adeline Pierrot.
ArXiv

The interval posets of permutations seen from the decomposition tree perspective.
With Lapo Cioni and Benjamin Izart.
ArXiv

Journals

A logical limit law for 231-avoiding permutations.
With Michael Albert, Valentin Feray and Marc Noy.
ArXiv, DMTCS vol 26:1 (special volume for Permutation Patterns 2023), 2024.

Baxter Tree-like Tableaux.
With Jean-Christophe Aval, Adrien Boussicault, Olivier Guibert and Matteo Silimbani.
Australasian Journal of Combinatorics, vol. 86(1), p.24-75, 2023.
ArXiv, Australasian Journal of Combinatorics

Preimages under the bubblesort operator.
With Lapo Cioni and Luca Ferrari.
Electronic Journal of Combinatorics, vol. 29(4), Paper P4.32, 2022.
ArXiv, EJC

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations.
With Frédérique Bassino, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun and Adeline Pierrot.
Combinatorial Theory, vol. 2(3), Paper #15, 2022.
ArXiv, Combinatorial Theory

Scaling limits of permutation classes with a finite specification: a dichotomy.
With Frédérique Bassino, Valentin Féray, Lucas Gerin, Mickaël Maazoun and Adeline Pierrot.
Advances in Mathematics, vol. 405, Article 108513, 2022.
ArXiv, Adv. in Maths
The Jupyter notebook associated with this paper.

Random cographs: Brownian graphon limit and asymptotic degree distribution.
With Frédérique Bassino, Valentin Féray, Lucas Gerin, Mickaël Maazoun and Adeline Pierrot.
Random Structures and Algorithms, vol. 60, p.166-200, 2022.
ArXiv, RSA

Counting Phylogenetic Networks of level 1 and 2.
With Philippe Gambette and Marefatollah Mansouri.
Journal of Mathematical Biology, vol. 81, p.1357-1395, 2020.
ArXiv, JMB
The Maple worksheet associated with this paper.
Note: In a first version of this article, we considered phylogenetic networks with multiple (or parallel) edges.
The corresponding counting results can be found in this earlier Arxiv preprint, with associated Maple worksheet here.

Universal limits of substitution-closed permutation classes.
With Frédérique Bassino, Valentin Féray, Lucas Gerin, Mickaël Maazoun and Adeline Pierrot.
Journal of the European Mathematical Society, vol. 22(11), p.3565-3639, 2020.
ArXiv, JEMS

A decorated tree approach to random permutations in substitution-closed classes.
With Jacopo Borga, Valentin Féray and Benedikt Stufler.
Electronic Journal of Probability, vol. 25, paper no. 67, p.1-52, 2020.
ArXiv, EJP (via Project Euclid)

Some families of trees arising in permutation analysis.
With Marni Mishna and Cyril Nicaud.
Electronic Journal of Combinatorics, vol. 27(2), Paper P2.20, 2020.
ArXiv, EJC
The Maple worksheets associated with this paper.

Two first-order logics of permutations.
With Michael Albert and Valentin Feray.
Journal of Combinatorial Theory - Series A, vol. 71, Article 105158, 2020.
ArXiv, JCT-A

Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences.
With Nick Beaton, Veronica Guerrini and Simone Rinaldi.
Electronic Journal of Combinatorics, vol. 26(3), Paper P3.13, 2019.
ArXiv, EJC
The Mathematica worksheet associated with this paper. It makes use of Manuel Kauers' Guess package, available here .

Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers.
With Nick Beaton, Veronica Guerrini and Simone Rinaldi.
Theoretical Computer Science, vol. 777, 2019.
ArXiv, TCS

Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence.
With Veronica Guerrini, Andrew Rechnitzer and Simone Rinaldi
SIAM J. Discrete Math., vol. 32(4), 2018.
ArXiv, SIDMA
The Maple worksheet associated with this paper.

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.

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.

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

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

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

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

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

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

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

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

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

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

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

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 (link appears to be broken, and PuMA's website discontinued)

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

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

Posets and Permutations in the duplication-loss model.
With Elisa Pergola.
Pure Mathematics and Applications, vol. 19(2-3), 2008
PuMA (link appears to be broken, and PuMA's website discontinued)
A pdf can be found here.

Some statistics on permutations avoiding generalized patterns.
With Antonio Bernini and Luca Ferrari
Pure Mathematics and Applications, vol. 18(3-4), 2007
ArXiv, PuMA (link appears to be broken, and PuMA's website discontinued)

The Longest Common Pattern Problem for two Permutations.
With Dominique Rossin
Pure Mathematics and Applications, vol. 17(1-2), 2006.
PuMA (link appears to be broken, and PuMA's website discontinued)
A pdf can be found here.

Conferences with proceedings

(Arxiv links are often to long versions of papers of which an extended abstract was published in the corresponding conference proceedings.)

A canonical tree decomposition for order types, and some applications.
With Valentin Féray, Florent Koechlin and Xavier Goaoc.
40th International Symposium on Computational Geometry (SoCG 2024).
ArXiv

Semi-Baxter and Strong-Baxter Permutations.
With Veronica Guerrini, Andrew Rechnitzer and Simone Rinaldi.
FPSAC 2017 (29th International Conference on Formal Power Series and Algebraic Combinatorics, London, UK).
Séminaire Lotharingien de Combinatoire, vol. 78B, paper 19, 2017.
ArXiv, Proceedings

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

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

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

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

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

Enumeration of permutations sorted with two passes through a stack and D₈-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

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

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

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

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)

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.

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

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

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

Ouvrages collectifs (en français)

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.

Refined enumeration of permutations sorted with two stacks and a D₈-symmetry.
With Olivier Guibert.
Permutation Patterns 2012
ArXiv

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

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

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

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

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

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

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