Pages that link to "Item:Q892898"
From MaRDI portal
The following pages link to Interval scheduling and colorful independent sets (Q892898):
Displayed 14 items.
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Item:Q892898 (redirect page) (← links)
- (Q5005155) (← links)
- (Q5116473) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)