We study graph ordering problems with a min-max objective. A classical problem of this type
is cutwidth, where given a graph we want to order its vertices such that the number of edges …

Given a linear ordering of the vertices of a graph, the cutwidth of a vertex v with respect to
this ordering is the number of edges from any vertex before v (including v) to any vertex after …

A pattern α α (ie, a string of variables and terminals) matches a word w, if w can be obtained
by uniformly replacing the variables of α α by terminal words. The respective matching …

A pattern $\alpha $ is a string of variables and terminal letters. We say that $\alpha $
matches a word $ w $, consisting only of terminal letters, if $ w $ can be obtained by …

Abstract Let G=(V, E) be a graph on n vertices, where d (v) denotes the degree of vertex v,
and t (v) is a threshold associated with v. We consider a process in which initially a set S of …

In 2017 Day et al. introduced the notion of locality as a structural complexity-measure for
patterns in the field of pattern matching established by Angluin in 1980. In 2019 Casel et al …

This Chapter is divided into four sections. In the first Section 1.1, I will introduce the original
problem of matching patterns with variables, which is the central underlying concept for the …

The locality of words is a relatively young structural complexity measure, introduced by Day
et al. in 2017 in order to define classes of patterns with variables which can be matched in …

The domain of Combinatorics on Words, first introduced by Axel Thue in 1906, covers by
now many subdomains. In this work we are investigating scattered factors as a …