Skip to main navigation Skip to search Skip to main content

On the parameterized complexity of interval scheduling with eligible machine sets

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'On the parameterized complexity of interval scheduling with eligible machine sets'. Together they form a unique fingerprint.
Sort by

Keyphrases

Computer Science