Kim Thang Nguyen: -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. SOFSEM 2009: 413-424