When given a dynamic graph, i.e.a graph that changes over time, one has to take into accounFt not only the static criteria of layout quality, but also the effort users spent to regain familiarity with the layout. Therefore, consecutive layouts should compromize between quality and stability. We here extend Tamassia’s layout model to dynamic graphs in a way that allows to specify the relative importance of the nu ber of bends vs. the number of changes between consecutive layouts. We also show that optimal layouts in the dynamic odel can be computed efficiently by means that are very similar to the static model, namely by solving a minimum cost flow proble in a suitably defined network.