Adding isolated vertices makes some greedy online algorithms optimal

It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.