Mathilde Bouvel

Documents

Publications

	Convergence law for 231-avoiding permutations Michael Albert , Mathilde Bouvel , Valentin Féray , Marc Noy Discrete Mathematics and Theoretical Computer Science, inPress, Permutation Patterns 2023, ⟨10.46298/dmtcs.11751⟩ Article dans une revue hal-03908625v1
	Baxter Tree-like Tableaux Jean-Christophe Aval , Adrien Boussicault , Mathilde Bouvel , Olivier Guibert , Matteo Silimbani The Australasian Journal of Combinatorics, 2023, 86 (1), pp.24--75. ⟨10.48550/arXiv.2108.06212⟩ Article dans une revue hal-03385234v1
	Linear-sized independent sets in random cographs and increasing subsequences in separable permutations Frédérique Bassino , Mathilde Bouvel , Michael Drmota , Valentin Feray , Lucas Gerin Combinatorial Theory, 2022, 2 (3), https://escholarship.org/uc/item/23340676. ⟨10.5070/C62359179⟩ Article dans une revue hal-03366684v1
	Random cographs: Brownian graphon limit and asymptotic degree distribution Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Mickaël Maazoun Random Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩ Article dans une revue hal-02412976v1
	Preimages under the bubblesort operator Mathilde Bouvel , Lapo Cioni , Luca Ferrari The Electronic Journal of Combinatorics, 2022, 29 (4), https://www.combinatorics.org/ojs/index.php/eljc/article/view/v29i4p32. ⟨10.37236/11390⟩ Article dans une revue hal-03844028v1
	Scaling limits of permutation classes with a finite specification: a dichotomy Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Mickaël Maazoun Advances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩ Article dans une revue hal-02412965v1
	Counting phylogenetic networks of level 1 and 2 Mathilde Bouvel , Philippe Gambette , Marefatollah Mansouri Journal of Mathematical Biology, 2020, 81, pp.1357-1395. ⟨10.1007/s00285-020-01543-5⟩ Article dans une revue hal-02955527v1
	A decorated tree approach to random permutations in substitution-closed classes Jacopo Borga , Mathilde Bouvel , Valentin Feray , Benedikt Stufler Electronic Journal of Probability, 2020, 25, ⟨10.1214/20-EJP469⟩ Article dans une revue hal-02998759v1
	Two first-order logics of permutations Mathilde Bouvel , Valentin Feray , Michael Albert Journal of Combinatorial Theory, Series A, 2020, 171, pp.105-158. ⟨10.1016/j.jcta.2019.105158⟩ Article dans une revue hal-02998767v1
	Some families of trees arising in permutation analysis Mathilde Bouvel , Marni Mishna , Cyril Nicaud The Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩ Article dans une revue hal-03002214v1
	Universal limits of substitution-closed permutation classes Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Mickaël Maazoun Journal of the European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩ Article dans une revue hal-01653572v1
	The Brownian limit of separable permutations Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Adeline Pierrot Annals of Probability, 2018, 46 (4), pp.2134 - 2189. ⟨10.1214/17-AOP1223⟩ Article dans une revue hal-01818309v1
	An algorithm computing combinatorial specifications of permutation classes Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Carine Pivoteau , Dominique Rossin Discrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩ Article dans une revue hal-01175234v1
	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 Advances in Applied Mathematics, 2015, 64, pp.124 - 200. ⟨10.1016/j.aam.2014.12.001⟩ Article dans une revue hal-01818308v1
	Combinatorics of non-ambiguous trees Jean-Christophe Aval , Adrien Boussicault , Mathilde Bouvel , Matteo Silimbani Advances in Applied Mathematics, 2014, 56, pp.78-108. ⟨10.1016/j.aam.2013.11.004⟩ Article dans une revue hal-00988123v1
	Refined enumeration of permutations sorted with two stacks and a $D_8$-symmetry. Mathilde Bouvel , Olivier Guibert Annals of Combinatorics, 2014, 18 (2), pp.199-232. ⟨10.1007/s00026-014-0219-8⟩ Article dans une revue hal-00991969v1
	Geometric grid classes of permutations Michael H. Albert , M. D. Atkinson , Mathilde Bouvel , Nik Ruškuc , Vincent Vatter Transactions of the American Mathematical Society, 2013, 365 (11), pp.5859-5881. ⟨10.1090/S0002-9947-2013-05804-7⟩ Article dans une revue hal-00640059v1
	On the enumeration of d-minimal permutations Mathilde Bouvel , Luca Ferrari Discrete Mathematics and Theoretical Computer Science, 2013, 15 (2), pp.33-48 Article dans une revue hal-00530158v2
	Average-case analysis of perfect sorting by reversals Mathilde Bouvel , Cédric Chauve , Marni Mishna , Dominique Rossin Discrete Mathematics, Algorithms and Applications, 2011, 3 (3), pp.369-392. ⟨10.1142/S1793830911001280⟩ Article dans une revue hal-00649761v1
	Enumeration of Pin-Permutations Frédérique Bassino , Mathilde Bouvel , Dominique Rossin The Electronic Journal of Combinatorics, 2011, 18 (1), pp.P57 Article dans une revue hal-00348664v2
	On the inverse image of pattern classes under bubble sort Michael H. Albert , M. D. Atkinson , Mathilde Bouvel , Anders Claesson , Mark Dukes Journal of Combinatorics, 2011, 2 (2), pp.231-244 Article dans une revue hal-00525425v1
	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 Pure Mathematics and Applications, 2010, 21 (2), pp.119-135 Article dans une revue hal-00458295v3
	Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents. Mathilde Bouvel , Elisa Pergola Theoretical Computer Science, 2010, 411 (26-28), pp.2487-2501 Article dans une revue hal-00286561v1
	A variant of the tandem duplication - random loss model of genome rearrangement Mathilde Bouvel , Dominique Rossin Theoretical Computer Science, 2009, 410 (8-10), pp.847-858. ⟨10.1016/j.tcs.2008.11.017⟩ Article dans une revue hal-00206178v1
	The Longest Common Pattern Problem for two Permutations Dominique Rossin , Mathilde Bouvel Pure Mathematics and Applications, 2006, 17 (1-2), pp.55-69 Article dans une revue hal-00115598v1

	Analysis of Algorithms for Permutations Biased by Their Number of Records Nicolas Auger , Mathilde Bouvel , Cyril Nicaud , Carine Pivoteau 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithm AOFA 2016, Jul 2016, Cracovie, Poland Communication dans un congrès hal-01838692v1
	Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled Mathilde Bouvel , Veronica Guerrini , Simone Rinaldi 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6357⟩ Communication dans un congrès hal-02173392v1
	Operators of equivalent sorting power and related Wilf-equivalences Michael Albert , Mathilde Bouvel 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.671-682, ⟨10.46298/dmtcs.2333⟩ Communication dans un congrès hal-01229676v1
	Quelques cas d'énumération de permutations triées par pile et en combinant des symétries Olivier Guibert , Mathilde Bouvel Journées de Combinatoire de Bordeaux, 2013, France Communication dans un congrès hal-00987990v1
	Some simple varieties of trees arising in permutation analysis Mathilde Bouvel , Marni Mishna , Cyril Nicaud 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.825-836, ⟨10.46298/dmtcs.2346⟩ Communication dans un congrès hal-01229665v1
	Combinatorics of non-ambiguous trees Jean-Christophe Aval , Adrien Boussicault , Mathilde Bouvel , Matteo Silimbani 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.49-60 Communication dans un congrès hal-01229716v1
	Refined enumeration of permutations sorted with two stacks and a D_8-symmetry Mathilde Bouvel , Olivier Guibert 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.757-768 Communication dans un congrès hal-00749260v1
	Combinatorial specification of permutation classes Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Carine Pivoteau , Dominique Rossin 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.781 - 792, ⟨10.46298/dmtcs.3082⟩ Communication dans un congrès hal-00685023v1
	Enumeration of permutations sorted with two passes through a stack and D_8 symmetries Mathilde Bouvel , Olivier Guibert 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.757-768, ⟨10.46298/dmtcs.3080⟩ Communication dans un congrès hal-01283130v1
	Average-case analysis of perfect sorting by reversals Mathilde Bouvel , Cedric Chauve , Marni Mishna , Dominique Rossin CPM'09, Jun 2009, Lille, France. pp.314-325, ⟨10.1007/978-3-642-02441-2_28⟩ Communication dans un congrès hal-00354235v1
	Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Dominique Rossin Permutation Patterns 2009 (PP 2009), Jul 2009, Florence, Italy. pp.13-20 Communication dans un congrès hal-00459647v1
	Posets and Permutations in the duplication-loss model Mathilde Bouvel , Elisa Pergola GASCOM'08, Jun 2008, Bibbiena, Italy Communication dans un congrès hal-00322737v1
	Longest Common Separable Pattern between Permutations Mathilde Bouvel , Dominique Rossin , Stéphane Vialette Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327 Communication dans un congrès hal-00128750v1
	Longest Common Separable Pattern between Permutations Mathilde Bouvel , Dominique Rossin , Stéphane Vialette Symposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327 Communication dans un congrès hal-00620293v1
	Some statistics on permutations avoiding generalized patterns A. Bernini , M. Bouvel , L. Ferrari GASCom 2006, Sep 2006, Dijon, France Communication dans un congrès hal-00117319v1
	Combinatorial search on graphs motivated by bioinformatics applications: a brief survey Mathilde Bouvel , Vladimir Grebinski , Gregory Kucherov 31st International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2005, Jun 2005, Metz/France, pp.16-27, ⟨10.1007/11604686_2⟩ Communication dans un congrès inria-00000885v1

	Dense and nondense limits for uniform random intersection graphs Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Adeline Pierrot 2024 Pré-publication, Document de travail hal-04456866v1
	Scaling limit of graph classes through split decomposition Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Adeline Pierrot 2022 Pré-publication, Document de travail hal-03797906v1
	The interval posets of permutations seen from the decomposition tree perspective Mathilde Bouvel , Lapo Cioni , Benjamin Izart 2021 Pré-publication, Document de travail hal-03456772v1

Mathilde Bouvel

Publications

Convergence law for 231-avoiding permutations

Baxter Tree-like Tableaux

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations

Random cographs: Brownian graphon limit and asymptotic degree distribution

Preimages under the bubblesort operator

Scaling limits of permutation classes with a finite specification: a dichotomy

Counting phylogenetic networks of level 1 and 2

A decorated tree approach to random permutations in substitution-closed classes

Two first-order logics of permutations

Some families of trees arising in permutation analysis

Universal limits of substitution-closed permutation classes

The Brownian limit of separable permutations

An algorithm computing combinatorial specifications of permutation classes

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

Combinatorics of non-ambiguous trees

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

Geometric grid classes of permutations

On the enumeration of d-minimal permutations

Average-case analysis of perfect sorting by reversals

Enumeration of Pin-Permutations

On the inverse image of pattern classes under bubble sort

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial

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

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

The Longest Common Pattern Problem for two Permutations

Analysis of Algorithms for Permutations Biased by Their Number of Records

Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled

Operators of equivalent sorting power and related Wilf-equivalences

Quelques cas d'énumération de permutations triées par pile et en combinant des symétries

Some simple varieties of trees arising in permutation analysis

Combinatorics of non-ambiguous trees

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

Combinatorial specification of permutation classes

Enumeration of permutations sorted with two passes through a stack and D_8 symmetries

Average-case analysis of perfect sorting by reversals

Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial

Posets and Permutations in the duplication-loss model

Longest Common Separable Pattern between Permutations

Longest Common Separable Pattern between Permutations

Some statistics on permutations avoiding generalized patterns

Combinatorial search on graphs motivated by bioinformatics applications: a brief survey

Dense and nondense limits for uniform random intersection graphs

Scaling limit of graph classes through split decomposition

The interval posets of permutations seen from the decomposition tree perspective