Generalized Permutation Patterns
Generalized Permutation Patterns is a combinatorial pattern class that extends classical permutation patterns by allowing certain elements to be adjacent in the pattern to be required or forbidden to be adjacent in an occurrence, thereby refining the notion of pattern containment with additional structural constraints.
20
Publications
1.1K
Citations
24
Authors
18
Institutions
Publications per year
2017–2026
0
Parents
20
1–5 of 20
24
6
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 24
18
University of Haifa
Haifa, Israel
5 h-index
6 publications
119 citations

University Ucinf
Santiago, Chile
3 h-index
3 publications
46 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
2 h-index
2 publications
42 citations
Universitat de Barcelona
Barcelona, Spain
1 h-index
1 publications
19 citations

Reykjavík University
Reykjavik, Iceland
1 h-index
1 publications
128 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
1 publications
72 citations
Université de Bordeaux
Bordeaux, France
1 h-index
1 publications
27 citations
Iowa State University
Ames, United States
1 h-index
1 publications
25 citations
1–8 of 18
Repository · 6 publications · 119 citations
6
h-index
Repository · 3 publications · 66 citations
3
h-index
2 publications · 49 citations
2
h-index
2 publications · 145 citations
2
h-index
1 publications · 72 citations
1
h-index
1–5