default search action
Mathilde Bouvel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c4]Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin:
A Canonical Tree Decomposition for Chirotopes. SoCG 2024: 23:1-23:18 - [i14]Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin:
A canonical tree decomposition for order types, and some applications. CoRR abs/2403.10311 (2024) - [i13]Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau:
Record-biased permutations and their permuton limit. CoRR abs/2409.01692 (2024) - 2023
- [j21]Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Olivier Guibert, Matteo Silimbani:
Baxter tree-like tableaux. Australas. J Comb. 86: 24-75 (2023) - [j20]Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel:
Forty years of history. Eur. J. Comb. 111: 103689 (2023) - 2022
- [j19]Mathilde Bouvel, Lapo Cioni
, Luca S. Ferrari:
Preimages under the Bubblesort Operator. Electron. J. Comb. 29(4) (2022) - [j18]Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot:
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. Comb. Theory 2(3) (2022) - [j17]Frédérique Bassino
Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms 60(2): 166-200 (2022) - 2020
- [j16]Mathilde Bouvel, Marni Mishna
Some Families of Trees Arising in Permutation Analysis. Electron. J. Comb. 27(2): 2 (2020) - [j15]Michael H. Albert, Mathilde Bouvel, Valentin Féray
Two first-order logics of permutations. J. Comb. Theory A 171 (2020)
2010 – 2019
- 2019
- [j14]Nicholas R. Beaton
Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. Electron. J. Comb. 26(3): 3 (2019) - [j13]Nicholas R. Beaton
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Theor. Comput. Sci. 777: 69-92 (2019) - 2018
- [j12]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): 2795-2819 (2018) - [i12]Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi:
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. CoRR abs/1808.04114 (2018) - 2017
- [j11]Frédérique Bassino
An algorithm computing combinatorial specifications of permutation classes. Discret. Appl. Math. 224: 16-44 (2017) - [j10]Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi
Permutation classes and polyomino classes with excluded submatrices. Math. Struct. Comput. Sci. 27(2): 157-183 (2017) - 2016
- [i11]Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau:
Analysis of Algorithms for Permutations Biased by Their Number of Records. CoRR abs/1605.02905 (2016) - 2015
- [j9]Frédérique Bassino
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Adv. Appl. Math. 64: 124-200 (2015) - [j8]Michael H. Albert, Mathilde Bouvel:
A General Theory of Wilf-Equivalence for Catalan Structures. Electron. J. Comb. 22(4): 4 (2015) - [i10]Frédérique Bassino
An algorithm computing combinatorial specifications of permutation classes. CoRR abs/1506.00868 (2015) - 2014
- [j7]Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Matteo Silimbani:
Combinatorics of non-ambiguous trees. Adv. Appl. Math. 56: 78-108 (2014) - [j6]Michael H. Albert, Mathilde Bouvel:
Operators of Equivalent Sorting Power and Related Wilf-equivalences. Electron. J. Comb. 21(4): 4 (2014) - [i9]Michael H. Albert, Mathilde Bouvel:
Operators of equivalent sorting power and related Wilf-equivalences. CoRR abs/1402.2034 (2014) - 2013
- [j5]Mathilde Bouvel, Luca Ferrari
On the enumeration of d-minimal permutations. Discret. Math. Theor. Comput. Sci. 15(2): 33-48 (2013) - [i8]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 abs/1307.2006 (2013) - 2012
- [i7]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-case analysis of perfect sorting by reversals (Journal Version). CoRR abs/1201.0940 (2012) - 2011
- [j4]Frédérique Bassino, Mathilde Bouvel, Dominique Rossin:
Enumeration of Pin-Permutations. Electron. J. Comb. 18(1) (2011) - [j3]Mathilde Bouvel, Cédric Chauve, Marni Mishna
Average-Case Analysis of Perfect Sorting by Reversals. Discret. Math. Algorithms Appl. 3(3): 369-392 (2011) - 2010
- [j2]Mathilde Bouvel, Elisa Pergola:
Posets and permutations in the duplication-loss model: Minimal permutations with d descents. Theor. Comput. Sci. 411(26-28): 2487-2501 (2010) - [i6]Frédérique Bassino
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial. CoRR abs/1002.3866 (2010) - [i5]Mathilde Bouvel, Luca Ferrari:
On the enumeration of d-minimal permutations. CoRR abs/1010.5963 (2010)
2000 – 2009
- 2009
- [j1]Mathilde Bouvel, Dominique Rossin:
A variant of the tandem duplication - random loss model of genome rearrangement. Theor. Comput. Sci. 410(8-10): 847-858 (2009) - [c3]Mathilde Bouvel, Cédric Chauve, Marni Mishna
Average-Case Analysis of Perfect Sorting by Reversals. CPM 2009: 314-325 - [i4]Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-case analysis of perfect sorting by reversals. CoRR abs/0901.2847 (2009) - 2008
- [i3]Mathilde Bouvel, Elisa Pergola:
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents. CoRR abs/0806.1494 (2008) - 2007
- [c2]Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern Among Permutations. CPM 2007: 316-327 - [i2]Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern between Permutations. CoRR abs/math/0702109 (2007) - 2006
- [i1]Dominique Rossin, Mathilde Bouvel:
Longest Common Pattern between two Permutations. CoRR abs/math/0611679 (2006) - 2005
- [c1]Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. WG 2005: 16-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: