Before revision:  In addition, it gives us a polynomial-time algorithm for specific mixed unit interval graphs ; that improves a state-of-the-art result even for unit interval graphs .
After revision:  In addition, it gives us a polynomial-time algorithm for specific mixed unit interval graphs . We point out a substantial mistake in the proof of the polynomiality of the MaxCut problem on unit interval graphs .