Skip to content

Author

M. Elsheikh

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Enumeration Complexity of Permutation Classes

We study classes of permutations that are defined by avoidance of forbidden patterns. For each fixed finite set $B$ of forbidden patterns, we study the \emph{avoider enumeration problem}: given an integer $n$, output all $B$-avoiding permutations of length $n$. Avoider enumeration is output-polynomial for every fixed $...

M. Bodirsky, M. Elsheikh · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.