The following pages link to Arindam Khan (Q1979455):
Displaying 29 items.
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- On mimicking networks representing minimum terminal cuts (Q2446595) (← links)
- Improved Approximation for Vector Bin Packing (Q4575690) (← links)
- Improved Pseudo-Polynomial-Time Approximation for Strip Packing (Q4636556) (← links)
- Approximating Geometric Knapsack via L-packings (Q5035877) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- On Weighted Bipartite Edge Coloring. (Q5275363) (← links)
- Improved Approximation Algorithm for Two-Dimensional Bin Packing (Q5383961) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)
- Peak Demand Minimization via Sliced Strip Packing. (Q6090895) (← links)
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items (Q6090896) (← links)
- Near-optimal algorithms for stochastic online bin packing (Q6560796) (← links)
- A PTAS for packing hypercubes into a knapsack (Q6560875) (← links)
- Tight approximation algorithms for two-dimensional guillotine strip packing (Q6560877) (← links)
- A 3-approximation algorithm for maximum independent set of rectangles (Q6575111) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q6589763) (← links)
- Geometry meets vectors: approximation algorithms for multidimensional packing (Q6604634) (← links)
- Online and dynamic algorithms for geometric set cover and hitting set (Q6620538) (← links)
- Bin packing under random-order: breaking the barrier of 3/2 (Q6645514) (← links)
