No. Title Author Year
1 Better Approximations for General Caching and UFP-Cover Under Resource Augmentation Cristi, Andrés et al. 2020
2 Breaking the Barrier of 2 for the Storage Allocation Problem Mömke, Tobias et al. 2020
3 Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles Henzinger, Monika et al. 2020
4 Fixed-Parameter Algorithms for Unsplittable Flow Cover Cristi, Andrés et al. 2020
5 On the Two-Dimensional Knapsack Problem for Convex Polygons Merino, Arturo et al. 2020
6 Packing Cars into Narrow Roads: PTASs for Limited Supply Highway Grandoni, Fabrizio et al. 2019
7 Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack Grandoni, Fabrizio et al. 2019
8 Fixed-Parameter Approximation Schemes for Weighted Flowtime Wiese, Andreas 2018
9 Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Pilipczuk, Michal et al. 2018
10 A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time Wiese, Andreas 2017
11 A QPTAS for the General Scheduling Problem with Identical Release Dates Antoniadis, Antonios et al. 2017
12 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
13 On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine Das, Syamantak et al. 2017
14 This House Proves That Debating is Harder Than Soccer Neumann, Stefan et al. 2016
15 How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking Adamaszek, Anna et al. 2015
16 On Guillotine Cutting Sequences Abed, Fidaa et al. 2015
17 Scheduling periodic tasks in a hard real-time environment Eisenbrand, Friedrich et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 17

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI