Unit interval editing is fixed-parameter tractable

Our algorithm implies the fixed-parameter tractability of the unit interval edge deletion problem, for which we also present a more efficient algorithm running in time O(4k⋅(n+m)). Another result is an O(6k⋅(n+m))-time algorithm for the unit interval vertex deletion problem, significantly improving the algorithm of van 't Hof and Villanger, which runs in time O(6k⋅n6).