Mathilde Bouvel

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 15

Top Topics

Quantifier Elimination

Complex Patterns

Execution Times

Degree Distribution

Top Venues

Electron. J. Comb.

Adv. Appl. Math.

Math. Struct. Comput. Sci.

Publications

Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
A canonical tree decomposition for order types, and some applications. CoRR (2024)
Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
A Canonical Tree Decomposition for Chirotopes. SoCG (2024)
Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Olivier Guibert, Matteo Silimbani
Baxter tree-like tableaux. Australas. J Comb. 86 (2023)
Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel
Forty years of history. Eur. J. Comb. 111 (2023)
Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms 60 (2) (2022)
Mathilde Bouvel, Lapo Cioni, Luca S. Ferrari
Preimages under the Bubblesort Operator. Electron. J. Comb. 29 (4) (2022)
Mathilde Bouvel, Marni Mishna, Cyril Nicaud
Some Families of Trees Arising in Permutation Analysis. Electron. J. Comb. 27 (2) (2020)
Michael H. Albert, Mathilde Bouvel, Valentin Féray
Two first-order logics of permutations. J. Comb. Theory, Ser. A 171 (2020)
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. Electron. J. Comb. 26 (3) (2019)
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Theor. Comput. Sci. 777 (2019)
Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer, Simone Rinaldi
Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence. SIAM J. Discret. Math. 32 (4) (2018)
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. CoRR (2018)
Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi
Permutation classes and polyomino classes with excluded submatrices. Math. Struct. Comput. Sci. 27 (2) (2017)
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
An algorithm computing combinatorial specifications of permutation classes. Discret. Appl. Math. 224 (2017)
Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau
Analysis of Algorithms for Permutations Biased by Their Number of Records. CoRR (2016)
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Adv. Appl. Math. 64 (2015)
Michael H. Albert, Mathilde Bouvel
A General Theory of Wilf-Equivalence for Catalan Structures. Electron. J. Comb. 22 (4) (2015)
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
An algorithm computing combinatorial specifications of permutation classes. CoRR (2015)
Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Matteo Silimbani
Combinatorics of non-ambiguous trees. Adv. Appl. Math. 56 (2014)
Michael H. Albert, Mathilde Bouvel
Operators of equivalent sorting power and related Wilf-equivalences. CoRR (2014)
Michael H. Albert, Mathilde Bouvel
Operators of Equivalent Sorting Power and Related Wilf-equivalences. Electron. J. Comb. 21 (4) (2014)
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. CoRR (2013)
Mathilde Bouvel, Luca Ferrari
On the enumeration of d-minimal permutations. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
Average-case analysis of perfect sorting by reversals (Journal Version) CoRR (2012)
Frédérique Bassino, Mathilde Bouvel, Dominique Rossin
Enumeration of Pin-Permutations. Electron. J. Comb. 18 (1) (2011)
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
Average-Case Analysis of Perfect Sorting by Reversals. Discret. Math. Algorithms Appl. 3 (3) (2011)
Mathilde Bouvel, Elisa Pergola
Posets and permutations in the duplication-loss model: Minimal permutations with d descents. Theor. Comput. Sci. 411 (26-28) (2010)
Mathilde Bouvel, Luca Ferrari
On the enumeration of d-minimal permutations CoRR (2010)
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial CoRR (2010)
Mathilde Bouvel, Dominique Rossin
A variant of the tandem duplication - random loss model of genome rearrangement. Theor. Comput. Sci. 410 (8-10) (2009)
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
Average-case analysis of perfect sorting by reversals CoRR (2009)
Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
Average-Case Analysis of Perfect Sorting by Reversals. CPM (2009)
Mathilde Bouvel, Elisa Pergola
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents CoRR (2008)
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Longest Common Separable Pattern between Permutations CoRR (2007)
Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
Longest Common Separable Pattern Among Permutations. CPM (2007)
Dominique Rossin, Mathilde Bouvel
Longest Common Pattern between two Permutations CoRR (2006)
Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. WG (2005)