Decomposition Of Permutations

Decomposition of Permutations is a theoretical framework in combinatorics that systematically breaks down permutations into irreducible components or canonical structures, distinguished by their adherence to specific pattern-avoiding or block-separable properties.

54

Publications

2K

Citations

88

Authors

59

Institutions

Publications per year

2017–2026

7

Authors

88

  1. MH
    Michel Habib

    Centre National de la Recherche Scientifique, France

    2 publications · 42 citations

    2

    h-index

  2. LG
    Leonidas Guibas

    Stanford University, United States

    2 publications · 46 citations

    2

    h-index

  3. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    2 publications · 77 citations

    2

    h-index

  4. JH
    Jonathan Huang

    Google (United States), United States

    2 publications · 46 citations

    2

    h-index

  5. CC
    Christian Capelle

    Centre National de la Recherche Scientifique, France

    2 publications · 42 citations

    2

    h-index

1–5 of 88

Venues

  1. Discrete Mathematics

    3 publications · 93 citations

    3

    h-index

  2. Journal of Combinatorial Theory Series A

    3 publications · 65 citations

    3

    h-index

  3. European Journal of Combinatorics

    3 publications · 150 citations

    3

    h-index

  4. Journal of Algebra

    3 publications · 40 citations

    3

    h-index

  5. IEEE Transactions on Computers

    3 publications · 48 citations

    3

    h-index

1–5