Filter your results
- 21
- 19
- 22
- 16
- 2
- 33
- 18
- 3
- 3
- 2
- 5
- 1
- 1
- 2
- 1
- 2
- 6
- 3
- 3
- 2
- 3
- 1
- 2
- 2
- 1
- 39
- 1
- 19
- 13
- 11
- 11
- 10
- 9
- 7
- 7
- 6
- 5
- 5
- 4
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 40
- 12
- 11
- 7
- 7
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
40 Results
|
|
sorted by
|
|
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⟩
Journal articles
hal-00206178v1
|
||
|
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
Conference papers
hal-00128750v1
|
||
|
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
Conference papers
hal-01838692v1
|
||
|
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
Journal articles
hal-00458295v3
|
||
|
Combinatorics of non-ambiguous treesAdvances 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-symmetry24th 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.Annals of Combinatorics, 2014, 18 (2), pp.199-232. ⟨10.1007/s00026-014-0219-8⟩
Journal articles
hal-00991969v1
|
||
|
Combinatorics of non-ambiguous trees25th 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 dichotomyAdvances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩
Journal articles
hal-02412965v1
|
||
|
Universal limits of substitution-closed permutation classesJournal 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 perspective2021
Preprints, Working Papers, ...
hal-03456772v1
|
||
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⟩
Conference papers
istex
inria-00000885v1
|
|||
|
Some statistics on permutations avoiding generalized patternsGASCom 2006, Sep 2006, Dijon, France
Conference papers
hal-00117319v1
|
||
|
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
Conference papers
hal-00459647v1
|
||
Longest Common Separable Pattern between PermutationsSymposium 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 analysisThe Electronic Journal of Combinatorics, 2020, ⟨10.37236/6504⟩
Journal articles
hal-03002214v1
|
||
|
The Brownian limit of separable permutationsAnnals of Probability, 2018, 46 (4), pp.2134 - 2189. ⟨10.1214/17-AOP1223⟩
Journal articles
hal-01818309v1
|
||
|
Two first-order logics of permutationsJournal of Combinatorial Theory, Series A, 2020, 171, pp.105-158. ⟨10.1016/j.jcta.2019.105158⟩
Journal articles
hal-02998767v1
|
||
|
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⟩
Conference papers
hal-02173392v1
|
||
|
Average-case analysis of perfect sorting by reversalsCPM'09, Jun 2009, Lille, France. pp.314-325, ⟨10.1007/978-3-642-02441-2_28⟩
Conference papers
hal-00354235v1
|
||
|
The Longest Common Pattern Problem for two PermutationsPure Mathematics and Applications, 2006, 17 (1-2), pp.55-69
Journal articles
hal-00115598v1
|
||
|
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⟩
Conference papers
hal-01229665v1
|
||
|
Posets and Permutations in the duplication-loss modelGASCOM'08, Jun 2008, Bibbiena, Italy
Conference papers
hal-00322737v1
|
||
|
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⟩
Journal articles
hal-01818308v1
|
||
Quelques cas d'énumération de permutations triées par pile et en combinant des symétriesJournées de Combinatoire de Bordeaux, 2013, France
Conference papers
hal-00987990v1
|
|||
|
An algorithm computing combinatorial specifications of permutation classesDiscrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩
Journal articles
hal-01175234v1
|
||
|
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⟩
Conference papers
hal-01229676v1
|
||
|
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⟩
Conference papers
hal-00685023v1
|
||
|
Linear-sized independent sets in random cographs and increasing subsequences in separable permutationsCombinatorial 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 distributionRandom Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩
Journal articles
hal-02412976v1
|
- 1
- 2