[en] We study the maximum weighted independent-set problem on interval graphs with
uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max
regret criterion to evaluate solutions. For a discrete scenario set, we nd that the problem is
NP-hard for each of the robustness criteria; we also provide pseudo-polynomial time algorithms
when there is a constant number of scenarios and show that the problem is strongly NP-hard
when the set of scenarios is unbounded. When the scenario set is a Cartesian product, we prove
that the problem is equivalent to a maximum weighted independent-set problem on the same
interval graph but without uncertainty for the rst objective function and that the scenario set
can be reduced for the second objective function.
