A sample of n generic points in the xy-plane defines a permutation that relates their ranks
along the two axes. Every subset of k points similarly defines a pattern, which occurs in that …

In this work we present a general and versatile algorithmic framework for exhaustively
generating a large variety of different combinatorial objects, based on encoding them as …

In this work we present a general and versatile algorithmic framework for exhaustively
generating a large variety of different combinatorial objects, based on encoding them as …

Permutation patterns and pattern avoidance have been intensively studied in combinatorics
and computer science, going back at least to the seminal work of Knuth on stack-sorting …

The Permutation Pattern Matching problem, asking whether a pattern permutation π is
contained in a permutation τ, is known to be NP-complete. In this paper we present two …

Multiple interval graphs are a well-known generalization of interval graphs, where each
vertex of a graph is represented by a d-interval (the union of d intervals) for some natural …

Abstract The Permutation Pattern Matching problem asks, given two permutations σ on n
elements and π, whether σ admits a subsequence with the same relative order as π (or, in …

We consider the problem of counting the copies of a length-$ k $ pattern $\sigma $ in a
sequence $ f\colon [n]\to\mathbb {R} $, where a copy is a subset of indices $ i_1<\ldots< …

Permutation pattern matching (PPM) is the problem of determining whether a permutation π
is contained in another permutation τ, ie τ has a subsequence that is order-isomorphic to π …

We study in this paper the Doubly Partially Ordered Pattern Matching (or DPOP Matching)
problem, a natural extension of the Permutation Pattern Matching problem. Permutation …