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
Parents
30
Jürgen Herzog, Takayuki Hibi · Journal of Algebraic Combinatorics · 2002 · 153 citations · Full text
AN OVERVIEW OF THE APPLICATIONS OF MULTISETS 1
Deeksha Singh, A. M. Ibrahim, T. Yohanna et al. · 2007 · 113 citations
Multiset topologies induced by multiset relations
K. P. Girish, Sunil Jacob John · Information Sciences · 2011 · 88 citations
Sorting and Searching in Multisets
Ian Munro, Philip M. Spira · SIAM Journal on Computing · 1976 · 79 citations
1–5 of 30
59
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 59
44
University of Pennsylvania
Philadelphia, United States
2 h-index
2 publications
51 citations
Arizona State University
Tempe, United States
2 h-index
4 publications
90 citations
Temple University
Philadelphia, United States
2 h-index
3 publications
79 citations

Barry University
Miami, United States
2 h-index
2 publications
140 citations
University of Colorado Boulder
Boulder, United States
2 h-index
2 publications
25 citations

University of Zagreb
Zagreb, Croatia
1 h-index
4 publications
52 citations

National Institute of Technology Calicut
Kozhikode, India
1 h-index
1 publications
88 citations
Juraj Dobrila University of Pula
Pula, Croatia
1 h-index
1 publications
13 citations
1–8 of 44
5 publications · 130 citations
5
h-index
2 publications · 33 citations
2
h-index
1 publications · 34 citations
1
h-index
PROC · 1 publications · 14 citations
1
h-index
1 publications · 22 citations
1
h-index
1–5