The following pages link to Klaus Jansen (Q243609):
Displaying 5 items.
- Restrictions of graph partition problems. I (Q672380) (← links)
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme (Q1879360) (← links)
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs (Q5317197) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463389) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
