Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Approximating Geometric Knapsack via L-packings | ACM Transactions on Algorithms |
| 2 | 2021 |
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing | Theory of Computing Systems |
| 6 | 2020 |
Hardness of Approximation for Strip Packing | ACM Transactions on Computation Theory |
| 5 | 2017 |
A(5/3+ε)-approximation for strip packing | Computational Geometry |
| 19 | 2014 |
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks | Discrete & Computational Geometry |
| 51 | 2012 |