Home
Browse
Last articles
Document list
By author
By year
By laboratory
By document type
Search
Search
advanced search
Services
Submit a publication
Submit a thesis
Export a publication list
Last 5 articles of the week
Links
INSMI
TEL
HAL
Search engine for bibliographic datas
arXiv
Front arXiv
21744 articles – 15574 references
[version française]
.:.
Browse
>
By author
> Bouvel .:.
15 documents ordered by :
Date
Title
first author name
document type
Submit date
Refined enumeration of permutations sorted with two stacks and a D_8-symmetry
Bouvel M., Guibert O.
Dans
Proceedings of FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics)
-
FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics)
, Japon (2012) [hal-00749260 - version 1]
Combinatorial specification of permutation classes
Bassino F., Bouvel M., Pierrot A., Pivoteau C., Rossin D.
Dans
Proceedings of FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics)
-
FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics)
, Japon (2012) [hal-00685023 - version 1]
Geometric grid classes of permutations
Albert M. H., Atkinson M.D., Bouvel M., Ruškuc N., Vatter V.
Transactions of the American Mathematical Society
(2012) à paraitre [hal-00640059 - version 1]
Average-case analysis of perfect sorting by reversals
Bouvel M., Chauve C., Mishna M., Rossin D.
Discrete Mathematics, Algorithms and Applications
3
, 3 (2011) 369-392 [hal-00649761 - version 1]
Enumeration of Pin-Permutations
Bassino F., Bouvel M., Rossin D.
Electronic Journal of Combinatorics
18
, 1 (2011) P57 [hal-00348664 - version 2]
On the inverse image of pattern classes under bubble sort
Albert M. H., Atkinson M.D., Bouvel M., Claesson A., Dukes M.
Journal of Combinatorics
2
, 2 (2011) 231-244 [hal-00525425 - version 1]
On the enumeration of d-minimal permutations
Bouvel M., Ferrari L.
[hal-00530158 - version 1] (27/10/2010)
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
Bassino F., Bouvel M., Pierrot A., Rossin D.
Pure Mathematics and Applications
21
, 2 (2010) 119-135 [hal-00458295 - version 3]
Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial
Bassino F., Bouvel M., Pierrot A., Rossin D.
In
Proceedings of PP 2009
-
Permutation Patterns 2009 (PP 2009)
, Italy (2009) [hal-00459647 - version 1]
Average-case analysis of perfect sorting by reversals
Bouvel M., Chauve C., Mishna M., Rossin D.
Dans
CPM'09 : Combinatorial Pattern Matching
-
CPM'09
, France (2009) [hal-00354235 - version 1]
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents.
Bouvel M., Pergola E.
Theoretical Computer Science
411
, 26-28 (2009) 2487-2501 [hal-00286561 - version 1]
A variant of the tandem duplication - random loss model of genome rearrangement
Bouvel M., Rossin D.
Theoretical Computer Science
410
, 8-10 (2009) 847-858 [hal-00206178 - version 1]
Posets and Permutations in the duplication-loss model
Bouvel M., Pergola E.
GASCOM'08
, Italy (2008) [hal-00322737 - version 1]
Longest Common Separable Pattern between Permutations
Bouvel M., Rossin D., Vialette S.
Dans
Combinatorial Pattern Matching (CPM) 2007, Proceedings
-
Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007
, Canada (2007) [hal-00128750 - version 1]
The Longest Common Pattern Problem for two Permutations
Rossin D., Bouvel M.
Pure Mathematics and Applications
17
, 1-2 (2006) 55-69 [hal-00115598 - version 1]