| Publication | Date of Publication | Type |
|---|
| Approximation schemes for geometric knapsack for packing spheres and fat objects | 2026-01-14 | Paper |
| Bin packing under random-order: breaking the barrier of 3/2 | 2024-11-28 | Paper |
| Online and dynamic algorithms for geometric set cover and hitting set | 2024-10-16 | Paper |
| Geometry meets vectors: approximation algorithms for multidimensional packing | 2024-09-12 | Paper |
A PTAS for the horizontal rectangle stabbing problem
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| A 3-approximation algorithm for maximum independent set of rectangles | 2024-07-19 | Paper |
| Near-optimal algorithms for stochastic online bin packing | 2024-06-24 | Paper |
| A PTAS for packing hypercubes into a knapsack | 2024-06-24 | Paper |
| Tight approximation algorithms for two-dimensional guillotine strip packing | 2024-06-24 | Paper |
Peak demand minimization via sliced strip packing
Algorithmica | 2023-12-13 | Paper |
Peak Demand Minimization via Sliced Strip Packing.
(available as arXiv preprint) | 2023-11-20 | Paper |
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items
(available as arXiv preprint) | 2023-11-20 | Paper |
| On Guillotine Separability of Squares and Rectangles. | 2023-10-31 | Paper |
| A Tight (3/2+ε) Approximation for Skewed Strip Packing. | 2023-10-31 | Paper |
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
Algorithmica | 2023-10-06 | Paper |
Tight approximation algorithms for geometric bin packing with skewed items
Algorithmica | 2023-09-27 | Paper |
| Improved Online Algorithms for Knapsack and GAP in the Random Order Model | 2023-02-03 | Paper |
A PTAS for the horizontal rectangle stabbing problem
(available as arXiv preprint) | 2022-08-16 | Paper |
| Best fit bin packing with random order revisited | 2022-07-18 | Paper |
Approximating Geometric Knapsack via L-packings
ACM Transactions on Algorithms | 2022-02-22 | Paper |
Best fit bin packing with random order revisited
Algorithmica | 2021-09-02 | Paper |
Improved online algorithms for knapsack and GAP in the random order model
Algorithmica | 2021-06-11 | Paper |
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
Improved approximation algorithm for two-dimensional bin packing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved Approximation for Vector Bin Packing
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved pseudo-polynomial-time approximation for strip packing
(available as arXiv preprint) | 2018-04-19 | Paper |
Approximation and online algorithms for multidimensional bin packing: a survey
Computer Science Review | 2017-08-31 | Paper |
| On weighted bipartite edge coloring | 2017-07-13 | Paper |
On mimicking networks representing minimum terminal cuts
Information Processing Letters | 2014-04-17 | Paper |
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
Discrete Applied Mathematics | 2014-04-16 | Paper |
