Cut elimination for the modal sequent calculi developed by P. Mateus, A. Sernadas, C. Sernadas and L. Viganò is analysed. General results are presented for eliminating cuts over labelled formulae and omega assertions. Sufficient conditions are given for removing cuts over truth-value assertions. Comparison with cut elimination in the context of non-labelled approaches to modal logic is provided. This talk reports ongoing joint work with P. Mateus, C. Sernadas and L. Viganò.