Pages that link to "Item:Q1772842"
From MaRDI portal
The following pages link to An introduction to multi-parameter complexity analysis of discrete problems (Q1772842):
Displaying 5 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
