On the NP-Hardness of Two Scheduling Problems Under Linear Constraints.

Kameng Nip

Browse the full FAW paper archive.