Modern Graph Width Parameters: from Structure to Algorithms

The overarching goal of our Research in Groups programme is to advance the graph parametric approach to designing efficient algorithms for central discrete optimization problems. We will focus on widening the algorithmic applicability of three activelystudied modern graph parameters (sim-width and alpha-tree- idth), by exploiting their structural properties. By harnessing the complementary expertise of our six team members, from departments of Mathematics and Computer Science, in both structural and algorithmic graph theory and our combined expertise with these three different width parameters, we are in a strong position to attack some well-known conjectures and we expect to make significant progress.