Computational problems on networks can often be solved by efficient algorithms on graph models of such networks. Many graph algorithms first decompose the graph into parts and stitch problem solutions for the parts back to a solution for the whole. This requires the interface between different parts of the decomposition to be highly structured and sufficiently small, as measured by the width of the decomposition.
The workshop aims to identify open problems within fundamental and computational challenges for decomposition width measures. By bringing together researchers from both the fundamental and computational side of the spectrum, the workshop will investigate the bottlenecks to solve these open problems.
The workshop focuses on the computation of width measures, connections to combinatorial optimization, and applications in algorithms for various width measures including treewidth, cliquewidth, and booleanwidth.