On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs