Any permutation of ordered n-element set [n]=:{1,..., n} may be regarded as introducing a
(possibly null) measure of disorder to that set. For example, the natural order of [7] is …

A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …

Hints of the study of patterns in permutations date back a century, to Volume I, Section III,
Chapter V of MacMahon's 1915 magnum opus Combinatory Analysis [126]. In that work …

We say that two sequences x and w of length m are order-isomorphic (of the same “shape”)
if w [i]⩽ w [j] if and only if x [i]⩽ x [j] for each i, j∈[1, m]. We present a simple linear time …

Given two permutations σ and π, the Permutation Pattern problem asks if σ is a subpattern of
π. We show that the problem can be solved in time 2 O (ℓ 2 log ℓ). n, where ℓ=| σ| and n=| π …

Providing feedback on programming assignments manually is a tedious, error prone, and
time-consuming task. In this paper, we motivate and address the problem of generating …

We review the various ways that stacks, their variations and their combinations, have been
used as sorting devices. In particular, we show that they have been a key motivator for the …

Despite success in many domains, neural models struggle in settings where train and test
examples are drawn from different distributions. In particular, in contrast to humans …

Can you decide if there is a coincidence in the numbers counting two different combinatorial
objects? For example, can you decide if two regions in R 3 have the same number of …

We study uniform random permutations in an important class of pattern-avoiding
permutations: the separable permutations. We describe the asymptotics of the number of …