Search - Archive ouverte HAL Access content directly

Filter your results

40 Results
Image document

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⟩
Journal articles hal-00206178v1
Image document

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
Conference papers hal-00128750v1
Image document

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
Conference papers hal-01838692v1
Image document

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
Journal articles hal-00458295v3
Image document

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⟩
Journal articles hal-00988123v1

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
Conference papers hal-00749260v1

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⟩
Journal articles hal-00991969v1
Image document

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
Conference papers hal-01229716v1

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 et al.
Advances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩
Journal articles hal-02412965v1

Universal limits of substitution-closed permutation classes

Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Mickaël Maazoun et al.
Journal of the European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩
Journal articles hal-01653572v1

The interval posets of permutations seen from the decomposition tree perspective

Mathilde Bouvel , Lapo Cioni , Benjamin Izart
2021
Preprints, Working Papers, ... hal-03456772v1

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⟩
Conference papers istex inria-00000885v1

Some statistics on permutations avoiding generalized patterns

A. Bernini , M. Bouvel , L. Ferrari
GASCom 2006, Sep 2006, Dijon, France
Conference papers hal-00117319v1
Image document

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
Conference papers hal-00459647v1

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
Conference papers hal-00620293v1

Some families of trees arising in permutation analysis

Mathilde Bouvel , Marni Mishna , Cyril Nicaud
The Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩
Journal articles hal-03002214v1

The Brownian limit of separable permutations

Frédérique Bassino , Mathilde Bouvel , Valentin Féray , Lucas Gerin , Adeline Pierrot et al.
Annals of Probability, 2018, 46 (4), pp.2134 - 2189. ⟨10.1214/17-AOP1223⟩
Journal articles hal-01818309v1

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⟩
Journal articles hal-02998767v1
Image document

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⟩
Conference papers hal-02173392v1
Image document

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⟩
Conference papers hal-00354235v1
Image document

The Longest Common Pattern Problem for two Permutations

Dominique Rossin , Mathilde Bouvel
Pure Mathematics and Applications, 2006, 17 (1-2), pp.55-69
Journal articles hal-00115598v1
Image document

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⟩
Conference papers hal-01229665v1
Image document

Posets and Permutations in the duplication-loss model

Mathilde Bouvel , Elisa Pergola
GASCOM'08, Jun 2008, Bibbiena, Italy
Conference papers hal-00322737v1

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⟩
Journal articles hal-01818308v1

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
Conference papers hal-00987990v1

An algorithm computing combinatorial specifications of permutation classes

Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Carine Pivoteau , Dominique Rossin et al.
Discrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩
Journal articles hal-01175234v1
Image document

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⟩
Conference papers hal-01229676v1
Image document

Combinatorial specification of permutation classes

Frédérique Bassino , Mathilde Bouvel , Adeline Pierrot , Carine Pivoteau , Dominique Rossin et al.
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.781 - 792, ⟨10.46298/dmtcs.3082⟩
Conference papers hal-00685023v1

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 et al.
Combinatorial Theory, 2022, 2 (3), https://escholarship.org/uc/item/23340676. ⟨10.5070/C62359179⟩
Journal articles 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 et al.
Random Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩
Journal articles hal-02412976v1