Search trees on trees (STTs) generalize the fundamental binary search tr...
We study edge-labelings of the complete bidirected graph
↔K_n with funct...
The caterpillar associahedron 𝒜(G) is a polytope arising from the
rotati...
Search trees on trees (STTs) are a far-reaching generalization of binary...
Group testing is concerned with identifying t defective items in a set o...
Permutation patterns and pattern avoidance have been intensively studied...