Abstract
Optimization problems on graphs are often expressed in some formalism: logic, algebra, graph rewriting.
Often, classes of graphs defined by some structural properties have bounded width parameter values. Exploring these interplay of problems, graphs and width is the main theme of the workshop