Pattern Containment

Pattern Containment is a binary relation on permutations in which a permutation π is said to contain a pattern σ if there exists a subsequence of π that is order-isomorphic to σ.

10

Publications

308

Citations

26

Authors

30

Institutions

Publications per year

2017–2026

0

Authors

26

  1. AB
    Antonio Bernini

    University of Florence, Italy

    3 publications · 55 citations

    3

    h-index

  2. LF
    Luca Ferrari

    University of Florence, Italy

    3 publications · 55 citations

    3

    h-index

  3. RP
    Renzo Pinzani

    University of Florence, Italy

    2 publications · 41 citations

    2

    h-index

  4. JW
    Julian West

    University of Victoria, Canada

    2 publications · 41 citations

    2

    h-index

  5. ES
    Einar Steingrı́msson

    University of Strathclyde, United Kingdom

    1 publications · 14 citations

    1

    h-index

1–5 of 26

Venues

  1. The Electronic Journal of Combinatorics

    3 publications · 74 citations

    3

    h-index

  2. Discrete Mathematics

    1 publications · 24 citations

    1

    h-index

  3. Data Mining and Knowledge Discovery

    1 publications · 37 citations

    1

    h-index

  4. Discrete Mathematics & Theoretical Computer Science

    DMTCS · 1 publications · 17 citations

    1

    h-index

  5. SIAM Journal on Discrete Mathematics

    1 publications · 36 citations

    1

    h-index

1–5