In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph. The reason for this is that most natural graph problems turn out to be fixed parameter tractable when parameterized by treewidth. However, Graph Layout problems are a notable exception. In particular, no fixed parameter tractable algorithms are known for the Cutwidth, Bandwidth, Imbalance and Distortion problems parameterized by treewidth. In fact, Bandwidth

more »

... ins NPcomplete even restricted to trees. A possible way to attack graph layout problems is to consider structural parameterizations that are stronger than treewidth. In this paper we study graph layout problems parameterized by the size of the minimum vertex cover of the input graph. We show that all the mentioned problems are fixed parameter tractable. Our basic ingredient is a classical algorithm for Integer Linear Programming when parameterized by dimension, designed by Lenstra and later improved by Kannan. We hope that our results will serve to re-emphasize the importance and utility of this algorithm.