Mathilde Bouvel
Publications
Publications
|
|
Code de Conduite du GDR-IFMGDR-IFM. 2026 |
|
|
A canonical tree decomposition for order types, and some applicationsSIAM Journal on Discrete Mathematics, 2025, 39 (4), pp.2189-2241. ⟨10.1137/24M1672201⟩ |
|
|
Between weak and Bruhat: the middle order on permutationsGraphs and Combinatorics, 2025, 41 (2), pp.34. ⟨10.1007/s00373-024-02885-3⟩ |
|
|
Scaling limit of graph classes through split decompositionThe Australasian Journal of Combinatorics, 2025, 92 (3), pp.266-319. ⟨10.48550/arXiv.2207.12253⟩ |
|
|
The interval posets of permutations seen from the decomposition tree perspectiveOrder, 2025, 42, pp.459-479. ⟨10.1007/s11083-024-09690-w⟩ |
|
|
Enumeration of pattern-avoiding alternating sign matrices: An asymptotic dichotomyAnnals of Combinatorics, In press, ⟨10.1007/s00026-025-00784-9⟩ |
|
|
Key-avoidance for alternating sign matricesDiscrete Mathematics and Theoretical Computer Science, 2024, vol. 27:1, Permutation Patterns 2024 (Special issues), ⟨10.46298/dmtcs.14058⟩ |
|
|
Convergence law for 231-avoiding permutationsDiscrete Mathematics and Theoretical Computer Science, 2024, Permutation Patterns 2023, 26 (1), ⟨10.46298/dmtcs.11751⟩ |
|
|
Baxter Tree-like TableauxThe Australasian Journal of Combinatorics, 2023, 86 (1), pp.24--75. ⟨10.48550/arXiv.2108.06212⟩ |
|
|
Scaling limits of permutation classes with a finite specification: a dichotomyAdvances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩ |
|
|
Random cographs: Brownian graphon limit and asymptotic degree distributionRandom Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩ |
|
|
Preimages under the bubblesort operatorThe Electronic Journal of Combinatorics, 2022, 29 (4), https://www.combinatorics.org/ojs/index.php/eljc/article/view/v29i4p32. ⟨10.37236/11390⟩ |
|
|
Linear-sized independent sets in random cographs and increasing subsequences in separable permutationsCombinatorial Theory, 2022, 2 (3), pp.23340676. ⟨10.5070/C62359179⟩ |
|
|
A decorated tree approach to random permutations in substitution-closed classesElectronic Journal of Probability, 2020, 25, ⟨10.1214/20-EJP469⟩ |
|
|
Some families of trees arising in permutation analysisThe Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩ |
|
|
Two first-order logics of permutationsJournal of Combinatorial Theory, Series A, 2020, 171, pp.105-158. ⟨10.1016/j.jcta.2019.105158⟩ |
|
|
Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciledDiscrete Mathematics and Theoretical Computer Science, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), ⟨10.46298/dmtcs.6357⟩ |
|
|
Universal limits of substitution-closed permutation classesJournal of the European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩ |
|
|
Counting phylogenetic networks of level 1 and 2Journal of Mathematical Biology, 2020, 81, pp.1357-1395. ⟨10.1007/s00285-020-01543-5⟩ |
|
|
The Brownian limit of separable permutationsThe Annals of Probability, 2018, 46 (4), pp.2134 - 2189. ⟨10.1214/17-AOP1223⟩ |
|
|
An algorithm computing combinatorial specifications of permutation classesDiscrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩ |
|
|
An algorithm for deciding the finiteness of the number of simple permutations in permutation classesAdvances in Applied Mathematics, 2015, 64, pp.124 - 200. ⟨10.1016/j.aam.2014.12.001⟩ |
|
|
Refined enumeration of permutations sorted with two stacks and a $D_8$-symmetry.Annals of Combinatorics, 2014, 18 (2), pp.199-232. ⟨10.1007/s00026-014-0219-8⟩ |
|
|
Combinatorics of non-ambiguous treesAdvances in Applied Mathematics, 2014, 56, pp.78-108. ⟨10.1016/j.aam.2013.11.004⟩ |
|
|
Some simple varieties of trees arising in permutation analysisDiscrete Mathematics and Theoretical Computer Science, 2013, DMTCS Proceedings, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), pp.825-836. ⟨10.46298/dmtcs.2346⟩ |
|
|
Combinatorics of non-ambiguous treesDiscrete Mathematics and Theoretical Computer Science, 2013, DMTCS Proceedings, AS, pp.49-60. ⟨10.46298/dmtcs.12792⟩ |
|
|
Operators of equivalent sorting power and related Wilf-equivalencesDiscrete Mathematics and Theoretical Computer Science, 2013, DMTCS Proceedings, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), pp.671-682. ⟨10.46298/dmtcs.2333⟩ |
|
|
Geometric grid classes of permutationsTransactions of the American Mathematical Society, 2013, 365 (11), pp.5859-5881. ⟨10.1090/S0002-9947-2013-05804-7⟩ |
|
|
On the enumeration of d-minimal permutationsDiscrete Mathematics and Theoretical Computer Science, 2013, 15 (2), pp.33-48 |
|
|
Combinatorial specification of permutation classesDiscrete Mathematics and Theoretical Computer Science, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), pp.781 - 792. ⟨10.46298/dmtcs.3082⟩ |
|
|
Enumeration of permutations sorted with two passes through a stack and D_8 symmetriesDiscrete Mathematics and Theoretical Computer Science, 2012, DMTCS Proceedings, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), pp.757-768. ⟨10.46298/dmtcs.3080⟩ |
|
|
Enumeration of Pin-PermutationsThe Electronic Journal of Combinatorics, 2011, 18 (1), pp.P57 |
|
|
On the inverse image of pattern classes under bubble sortJournal of Combinatorics, 2011, 2 (2), pp.231-244 |
|
|
Average-case analysis of perfect sorting by reversalsDiscrete Mathematics, Algorithms and Applications, 2011, 3 (3), pp.369-392. ⟨10.1142/S1793830911001280⟩ |
|
|
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomialPure mathematics and applications , 2010, 21 (2), pp.119-135 |
|
|
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents.Theoretical Computer Science, 2010, 411 (26-28), pp.2487-2501 |
|
|
A variant of the tandem duplication - random loss model of genome rearrangementTheoretical Computer Science, 2009, 410 (8-10), pp.847-858. ⟨10.1016/j.tcs.2008.11.017⟩ |
|
|
The Longest Common Pattern Problem for two PermutationsPure mathematics and applications , 2006, 17 (1-2), pp.55-69 |
|
|
Dense and nondense limits for uniform random intersection graphs2024 |
|
|
Analysis of Algorithms for Permutations Biased by Their Number of Records27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithm AOFA 2016, Jul 2016, Cracovie, Poland |
Quelques cas d'énumération de permutations triées par pile et en combinant des symétriesJournées de Combinatoire de Bordeaux, 2013, France |
|
|
|
Refined enumeration of permutations sorted with two stacks and a D_8-symmetry24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.757-768 |
|
|
Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomialPermutation Patterns 2009 (PP 2009), Jul 2009, Florence, Italy. pp.13-20 |
|
|
Average-case analysis of perfect sorting by reversalsCPM'09, Jun 2009, Lille, France. pp.314-325, ⟨10.1007/978-3-642-02441-2_28⟩ |
|
|
Posets and Permutations in the duplication-loss modelGASCOM'08, Jun 2008, Bibbiena, Italy |
Longest Common Separable Pattern between PermutationsSymposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327 |
|
|
|
Longest Common Separable Pattern between PermutationsCombinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327 |
|
|
Some statistics on permutations avoiding generalized patternsGASCom 2006, Sep 2006, Dijon, France |
Combinatorial search on graphs motivated by bioinformatics applications: a brief survey31st International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2005, Jun 2005, Metz/France, pp.16-27, ⟨10.1007/11604686_2⟩ |