| No. |
Title |
Author |
Year |
| 1 |
Exact and Approximation Algorithms for Routing a Convoy Through a Graph |
van Ee, Martijn et al. |
2023 |
| 2 |
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set |
Khan, Arindam et al. |
2023 |
| 3 |
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints |
Das, Syamantak et al. |
2022 |
| 4 |
Approximation Algorithms for Round-UFP and Round-SAP |
Kar, Debajyoti et al. |
2022 |
| 5 |
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing |
Khan, Arindam et al. |
2022 |
| 6 |
Additive Approximation Schemes for Load Balancing Problems |
Buchem, Moritz et al. |
2021 |
| 7 |
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back |
Grandoni, Fabrizio et al. |
2021 |
| 8 |
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees |
Martínez-Muñoz, Tomás et al. |
2021 |
| 9 |
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time |
Eberle, Franziska et al. |
2021 |
| 10 |
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More |
Gálvez, Waldo et al. |
2021 |
| 11 |
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem |
Khan, Arindam et al. |
2021 |
| 12 |
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation |
Cristi, Andrés et al. |
2020 |
| 13 |
Breaking the Barrier of 2 for the Storage Allocation Problem |
Mömke, Tobias et al. |
2020 |
| 14 |
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles |
Henzinger, Monika et al. |
2020 |
| 15 |
Fixed-Parameter Algorithms for Unsplittable Flow Cover |
Cristi, Andrés et al. |
2020 |
| 16 |
On the Two-Dimensional Knapsack Problem for Convex Polygons |
Merino, Arturo et al. |
2020 |
| 17 |
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway |
Grandoni, Fabrizio et al. |
2019 |
| 18 |
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack |
Grandoni, Fabrizio et al. |
2019 |
| 19 |
Fixed-Parameter Approximation Schemes for Weighted Flowtime |
Wiese, Andreas |
2018 |
| 20 |
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |
Pilipczuk, Michal et al. |
2018 |
| 21 |
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time |
Wiese, Andreas |
2017 |
| 22 |
A QPTAS for the General Scheduling Problem with Identical Release Dates |
Antoniadis, Antonios et al. |
2017 |
| 23 |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking |
Pilipczuk, Michal et al. |
2017 |
| 24 |
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine |
Das, Syamantak et al. |
2017 |
| 25 |
This House Proves That Debating is Harder Than Soccer |
Neumann, Stefan et al. |
2016 |
| 26 |
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking |
Adamaszek, Anna et al. |
2015 |
| 27 |
On Guillotine Cutting Sequences |
Abed, Fidaa et al. |
2015 |
| 28 |
Scheduling periodic tasks in a hard real-time environment |
Eisenbrand, Friedrich et al. |
2010 |
