Pages that link to "Item:Q892898"
From MaRDI portal
The following pages link to Interval scheduling and colorful independent sets (Q892898):
Displaying 27 items.
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- 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)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← 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)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- (Q4909542) (redirect page) (← links)
- (Q5005155) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5116473) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- (Q5874486) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Fixed interval scheduling with third‐party machines (Q6065340) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
- Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)
