Mathilde Bouvel

According to our database, Mathilde Bouvel authored at least 28 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A canonical tree decomposition for order types, and some applications.

Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin

CoRR, 2024

2023

Forty years of history.

Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel

Eur. J. Comb., June, 2023

Baxter tree-like tableaux.

Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Olivier Guibert, Matteo Silimbani

Australas. J Comb., June, 2023

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

Preimages under the Bubblesort Operator.

Mathilde Bouvel, Lapo Cioni, Luca S. Ferrari

Electron. J. Comb., 2022

2020

Two first-order logics of permutations.

Michael H. Albert, Mathilde Bouvel, Valentin Féray

J. Comb. Theory, Ser. A, 2020

Some Families of Trees Arising in Permutation Analysis.

Mathilde Bouvel, Marni Mishna, Cyril Nicaud

Electron. J. Comb., 2020

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

Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences.

Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi

Electron. J. Comb., 2019

2018

Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence.

Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer, Simone Rinaldi

SIAM J. Discret. Math., 2018

2017

Permutation classes and polyomino classes with excluded submatrices.

Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi

Math. Struct. Comput. Sci., 2017

An algorithm computing combinatorial specifications of permutation classes.

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin

Discret. Appl. Math., 2017

2016

Analysis of Algorithms for Permutations Biased by Their Number of Records.

Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau

CoRR, 2016

2015

A General Theory of Wilf-Equivalence for Catalan Structures.

Michael H. Albert, Mathilde Bouvel

Electron. J. Comb., 2015

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

2014

Operators of Equivalent Sorting Power and Related Wilf-equivalences.

Michael H. Albert, Mathilde Bouvel

Electron. J. Comb., 2014

Combinatorics of non-ambiguous trees.

Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Matteo Silimbani

Adv. Appl. Math., 2014

2013

On the enumeration of d-minimal permutations.

Mathilde Bouvel, Luca Ferrari

Discret. Math. Theor. Comput. Sci., 2013

2012

Average-case analysis of perfect sorting by reversals (Journal Version)

Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin

CoRR, 2012

2011

Average-Case Analysis of Perfect Sorting by Reversals.

Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin

Discret. Math. Algorithms Appl., 2011

Enumeration of Pin-Permutations.

Frédérique Bassino, Mathilde Bouvel, Dominique Rossin

Electron. J. Comb., 2011

2010

Posets and permutations in the duplication-loss model: Minimal permutations with d descents.

Mathilde Bouvel, Elisa Pergola

Theor. Comput. Sci., 2010

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

2009

A variant of the tandem duplication - random loss model of genome rearrangement.

Mathilde Bouvel, Dominique Rossin

Theor. Comput. Sci., 2009

2007

Longest Common Separable Pattern between Permutations

Mathilde Bouvel, Dominique Rossin, Stéphane Vialette

CoRR, 2007

Longest Common Separable Pattern Among Permutations.

Mathilde Bouvel, Dominique Rossin, Stéphane Vialette

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Longest Common Pattern between two Permutations

Dominique Rossin, Mathilde Bouvel

CoRR, 2006

2005

Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey.

Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005