Vel Nias gave almost the right answer in:

http://mathoverflow.net/questions/98651/how-to-get-the-largest-subset-of-a-set-of-sets-of-intervals-with-no-overlapping-i/98663#98663

but instead of the connected components we are looking for the maximum independent set in this graph.