Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. - Mathilde Bouvel; Vladimir Grebinski; Gregory Kucherov (WG, 2005)

Longest Common Pattern between two Permutations - Dominique Rossin; Mathilde Bouvel (CoRR, 2006)

Longest Common Separable Pattern Among Permutations. - Mathilde Bouvel; Dominique Rossin; Stéphane Vialette (CPM, 2007)

Longest Common Separable Pattern between Permutations - Mathilde Bouvel; Dominique Rossin; Stéphane Vialette (CoRR, 2007)

A variant of the tandem duplication - random loss model of genome rearrangement. - Mathilde Bouvel; Dominique Rossin (Theor. Comput. Sci., 2009)

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; Dominique Rossin (CoRR, 2010)

Posets and permutations in the duplication-loss model: Minimal permutations with d descents. - Mathilde Bouvel; Elisa Pergola (Theor. Comput. Sci., 2010)

Enumeration of Pin-Permutations. - Frédérique Bassino; Mathilde Bouvel; Dominique Rossin (Electron. J. Comb., 2011)

Average-Case Analysis of Perfect Sorting by Reversals. - Mathilde Bouvel; Cédric Chauve; Marni Mishna; Dominique Rossin (Discret. Math. Algorithms Appl., 2011)

Average-case analysis of perfect sorting by reversals (Journal Version) - Mathilde Bouvel; Cédric Chauve; Marni Mishna; Dominique Rossin (CoRR, 2012)

On the enumeration of d-minimal permutations. - Mathilde Bouvel; Luca Ferrari 001 (Discret. Math. Theor. Comput. Sci., 2013)

Combinatorics of non-ambiguous trees. - Jean-Christophe Aval; Adrien Boussicault; Mathilde Bouvel; Matteo Silimbani (Adv. Appl. Math., 2014)

Operators of Equivalent Sorting Power and Related Wilf-equivalences. - Michael H. Albert; Mathilde Bouvel (Electron. J. Comb., 2014)

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (Adv. Appl. Math., 2015)

A General Theory of Wilf-Equivalence for Catalan Structures. - Michael H. Albert; Mathilde Bouvel (Electron. J. Comb., 2015)

Analysis of Algorithms for Permutations Biased by Their Number of Records. - Nicolas Auger; Mathilde Bouvel; Cyril Nicaud; Carine Pivoteau (CoRR, 2016)

An algorithm computing combinatorial specifications of permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Carine Pivoteau; Dominique Rossin (Discret. Appl. Math., 2017)

Permutation classes and polyomino classes with excluded submatrices. - Daniela Battaglino; Mathilde Bouvel; Andrea Frosini; Simone Rinaldi (Math. Struct. Comput. Sci., 2017)

Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence. - Mathilde Bouvel; Veronica Guerrini; Andrew Rechnitzer; Simone Rinaldi (SIAM J. Discret. Math., 2018)

Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. - Nicholas R. Beaton; Mathilde Bouvel; Veronica Guerrini; Simone Rinaldi (Electron. J. Comb., 2019)

Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. - Nicholas R. Beaton; Mathilde Bouvel; Veronica Guerrini; Simone Rinaldi (Theor. Comput. Sci., 2019)

Some Families of Trees Arising in Permutation Analysis. - Mathilde Bouvel; Marni Mishna; Cyril Nicaud (Electron. J. Comb., 2020)

Two first-order logics of permutations. - Michael H. Albert; Mathilde Bouvel; Valentin Féray (J. Comb. Theory A, 2020)

Preimages under the Bubblesort Operator. - Mathilde Bouvel; Lapo Cioni; Luca S. Ferrari (Electron. J. Comb., 2022)

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. - Frédérique Bassino; Mathilde Bouvel; Michael Drmota; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Comb. Theory, 2022)

Random cographs: Brownian graphon limit and asymptotic degree distribution. - Frédérique Bassino; Mathilde Bouvel; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Random Struct. Algorithms, 2022)

A logical limit law for 231-avoiding permutations. - Michael Albert 001; Mathilde Bouvel; Valentin Féray; Marc Noy (Discret. Math. Theor. Comput. Sci., 2023)

Baxter tree-like tableaux. - Jean-Christophe Aval; Adrien Boussicault; Mathilde Bouvel; Olivier Guibert; Matteo Silimbani (Australas. J Comb., 2023)

Forty years of history. - Marthe Bonamy; Patrice Ossona de Mendez; Éric Colin de Verdière; Mathilde Bouvel (Eur. J. Comb., 2023)

A Canonical Tree Decomposition for Chirotopes. - Mathilde Bouvel; Valentin Féray; Xavier Goaoc; Florent Koechlin (SoCG, 2024)

A canonical tree decomposition for order types, and some applications. - Mathilde Bouvel; Valentin Féray; Xavier Goaoc; Florent Koechlin (CoRR, 2024)

Record-biased permutations and their permuton limit. - Mathilde Bouvel; Cyril Nicaud; Carine Pivoteau (CoRR, 2024)

Between Weak and Bruhat: The Middle Order on Permutations. - Mathilde Bouvel; Luca S. Ferrari; Bridget Eileen Tenner (Graphs Comb., 2025)