No. |
Title |
Author |
Year |
---|

1 |
Fixed-Parameter Approximation Schemes for Weighted Flowtime |
Wiese, Andreas |
2018 |

2 |
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |
Pilipczuk, Michal et al. |
2018 |

3 |
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time |
Wiese, Andreas |
2017 |

4 |
A QPTAS for the General Scheduling Problem with Identical Release Dates |
Antoniadis, Antonios et al. |
2017 |

5 |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking |
Pilipczuk, Michal et al. |
2017 |

6 |
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine |
Das, Syamantak et al. |
2017 |

7 |
This House Proves That Debating is Harder Than Soccer |
Neumann, Stefan et al. |
2016 |

8 |
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking |
Adamaszek, Anna et al. |
2015 |

9 |
On Guillotine Cutting Sequences |
Abed, Fidaa et al. |
2015 |

10 |
Scheduling periodic tasks in a hard real-time environment |
Eisenbrand, Friedrich et al. |
2010 |