|
 | Up a level |
Khan, A and Sharma, E (2023) Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. In: Algorithmica, 85 (9). pp. 2735-2778.
Galvez, W and Grandoni, F and Ameli, AJ and Jansen, K and Khan, A and Rau, M (2023) A Tight (3 / 2 + ε) -Approximation for Skewed Strip Packing. In: Algorithmica .
Deppert, MA and Jansen, K and Khan, A and Rau, M and Tutas, M (2023) Peak Demand Minimization via Sliced Strip Packing. In: Algorithmica, 85 (12). pp. 3649-3679.
Francis, MC and Hell, P and Jacob, D (2022) On the Kernel and Related Problems in Interval Digraphs. In: Algorithmica .
Albers, S and Khan, A and Ladewig, L (2021) Improved Online Algorithms for Knapsack and GAP in the Random Order Model. In: Algorithmica .
Huang, Chien-Chung and Kavitha, Telikepalli and Michail, Dimitrios and Nasre, Meghana (2011) Bounded Unpopularity Matchings. In: Algorithmica, 61 (3). pp. 738-757.
Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios (2011) New Approximation Algorithms for Minimum Cycle Bases of Graphs. In: Algorithmica, 59 (4). pp. 471-488.
Chandran, Sunil L and Francis, Mathew C and Sivadasan, Naveen (2010) Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. In: Algorithmica, 56 (2). pp. 129-140.
Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna E (2008) An (O)over-tilde (m(2)n) Algorithm for Minimum Cycle Basis of Graphs. In: Algorithmica, 52 (3). pp. 333-349.
Kapoor, S and Ramesh, H (2000) An Algorithm for enumerating All Spanning Trees of a Directed Graph. In: Algorithmica, 27 (2). pp. 120-130.
Mehlhorn, K and Sundar, R and Uhrig, C (1997) Maintaining dynamic sequences under equality tests in polylogarithmic time. In: Algorithmica, 17 (2). pp. 183-198.
