Mathilde Bouvel
Publications
Publications
|
|
Code de Conduite du GDR-IFMGDR-IFM. 2026 |
|
|
Dense and nondense limits for uniform random intersection graphs2024 |
|
|
Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6357⟩ |
|
|
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 |
|
|
Some simple varieties of trees arising in permutation analysis25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.825-836, ⟨10.46298/dmtcs.2346⟩ |
|
|
Combinatorics of non-ambiguous trees25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.49-60 |
Quelques cas d'énumération de permutations triées par pile et en combinant des symétriesJournées de Combinatoire de Bordeaux, 2013, France |
|
|
|
Operators of equivalent sorting power and related Wilf-equivalences25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.671-682, ⟨10.46298/dmtcs.2333⟩ |
|
|
Enumeration of permutations sorted with two passes through a stack and D_8 symmetries24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.757-768, ⟨10.46298/dmtcs.3080⟩ |
|
|
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 |
|
|
Combinatorial specification of permutation classes24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.781 - 792, ⟨10.46298/dmtcs.3082⟩ |
|
|
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 PermutationsCombinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327 |
Longest Common Separable Pattern between PermutationsSymposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, 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⟩ |