NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (22)

math.CO2008

Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents

Mathilde Bouvel, Elisa Pergola

math.CO2016

An algorithm computing combinatorial specifications of permutation classes

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2

math.CO2014

A general theory of Wilf-equivalence for Catalan structures

Michael Albert, Mathilde Bouvel

math.CO2008

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

Mathilde Bouvel, Dominique Rossin

math.CO2011

On the inverse image of pattern classes under bubble sort

Michael H. Albert, M. D. Atkinson, Mathilde Bouvel +2

cs.DM2016

Analysis of Algorithms for Permutations Biased by Their Number of Records

Nicolas Auger, Mathilde Bouvel, Cyril Nicaud +1

math.CO2018

Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence

Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer +1

cs.DM2012

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

Mathilde Bouvel, Cedric Chauve, Marni Mishna +1

math.CO2014

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1

math.CO2014

Operators of equivalent sorting power and related Wilf-equivalences

Michael Albert, Mathilde Bouvel

math.CO2006

Longest Common Pattern between two Permutations

Dominique Rossin, Mathilde Bouvel

math.CO2013

Combinatorics of non-ambiguous trees

Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel +1

math.CO2012

Refined enumeration of permutations sorted with two stacks and a D_8-symmetry

Mathilde Bouvel, Olivier Guibert

math.CO2009

Average-case analysis of perfect sorting by reversals

Mathilde Bouvel, Cedric Chauve, Marni Mishna +1

math.PR2017

The Brownian limit of separable permutations

Frédérique Bassino, Mathilde Bouvel, Valentin Féray +2

math.CO2016

Some families of trees arising in permutation analysis

Mathilde Bouvel, Marni Mishna, Cyril Nicaud

cs.DS2011

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 +1

math.CO2010

On the enumeration of d-minimal permutations

Mathilde Bouvel, Luca Ferrari

math.CO2012

Geometric grid classes of permutations

Michael H. Albert, M. D. Atkinson, Mathilde Bouvel +2

math.CO2007

Longest Common Separable Pattern between Permutations

Mathilde Bouvel, Dominique Rossin, Stephane Vialette

math.CO2014

Permutation classes and polyomino classes with excluded submatrices

Daniela Battaglino, Mathilde Bouvel, Andrea Frosini +1

math.CO2012

Combinatorial specification of permutation classes

Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2