Multiset Combinatorics

Multiset Combinatorics is a branch of enumerative combinatorics that studies the combinatorial properties and enumeration of multisets, distinguished from classical combinatorics by allowing elements to appear with multiplicity greater than one.

30

Publications

1K

Citations

59

Authors

44

Institutions

Publications per year

2017–2026

1

Authors

59

  1. TH
    Takayuki Hibi

    The University of Osaka, Japan

    2 publications · 175 citations

    2

    h-index

  2. MD
    M. D. Atkinson

    University of Otago, New Zealand

    2 publications · 51 citations

    2

    h-index

  3. GH
    Glenn Hurlbert

    Arizona State University, United States

    2 publications · 40 citations

    2

    h-index

  4. HS
    Herbert S. Wilf

    University of Pennsylvania, United States

    2 publications · 51 citations

    2

    h-index

  5. GC
    G.F. Clements

    University of Colorado Boulder, United States

    2 publications · 25 citations

    2

    h-index

1–5 of 59

Venues

  1. Discrete Mathematics

    5 publications · 130 citations

    5

    h-index

  2. The Electronic Journal of Combinatorics

    2 publications · 33 citations

    2

    h-index

  3. Journal of Algorithms

    1 publications · 34 citations

    1

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 1 publications · 14 citations

    1

    h-index

  5. Computers & Mathematics with Applications

    1 publications · 22 citations

    1

    h-index

1–5