Browse by IISc Authors

Garg, M and Kar, D and Khan, A (2024) Random-Order Online Independent Set of Intervals and Hyperrectangles. In: Leibniz International Proceedings in Informatics, LIPIcs -32nd Annual European Symposium on Algorithms, ESA 2024, 2 September 2024- 4 September 2024, London.

Acharya, P and Bhore, S and Gupta, A and Khan, A and Mondal, B and Wiese, A (2024) Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. In: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 8 July 2024through 12 July 2024, Tallinn.

Khan, A and Subramanian, A and Wiese, A (2024) A PTAS for the horizontal rectangle stabbing problem. In: Mathematical Programming .

Khan, A and Sharma, E (2023) Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. In: Algorithmica, 85 (9). pp. 2735-2778.

Patil, V and Nair, V and Ghalme, G and Khan, A (2023) Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. In: International Joint Conference on Artificial Intelligence, IJCAI 2023, 19 - 25 August 2023, Macao, pp. 4100-4108.

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.

Chakraborty, D and Das, S and Khan, A and Subramanian, A (2022) Fair Rank Aggregation. In: 36th Conference on Neural Information Processing Systems, NeurIPS 2022, 28 - 9 December 2022, New Orleans.

Khan, A and Sharma, E and Sreenivas, KVN (2022) Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. In: Leibniz International Proceedings in Informatics, LIPIcs, 18 - 20 December 2022, Chennai.

Kar, D and Khan, A and Wiese, A (2022) Approximation Algorithms for Round-UFP and Round-SAP. In: 30th Annual European Symposium on Algorithms, ESA 2022, 5 - 9 September 2022, Berlin/Potsdam.

Ayyadevara, N and Dabas, R and Khan, A and Sreenivas, KVN (2022) Near-Optimal Algorithms for Stochastic Online Bin Packing. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Jansen, K and Khan, A and Lira, M and Sreenivas, KVN (2022) A PTAS for Packing Hypercubes into a Knapsack. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Khan, A and Lonkar, A and Maiti, A and Sharma, A and Wiese, A (2022) Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Galvez, W and Khan, A and Mari, M and Mömke, T and Pittu, MR and Wiese, A (2022) A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 9 January 2022 through 12 January 2022, Alexander, pp. 894-905.

Maiti, A and Patil, V and Khan, A (2021) Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. In: 35th Conference on Neural Information Processing Systems, NeurIPS 2021, 6 December 2021 through 14 December 2021, Virtual, Online, pp. 19553-19565.

Patel, D and Khan, A and Louis, A (2021) Group fairness for knapsack problems. In: 20th International Conference on Autonomous Agents and Multiagent Systems, 3-7 May 2021, pp. 989-997.

Albers, S and Khan, A and Ladewig, L (2021) Improved Online Algorithms for Knapsack and GAP in the Random Order Model. In: Algorithmica .

Gálvez, W and Grandoni, F and Khan, A and Ramírez-Romero, D and Wiese, A (2021) Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple L-shapes, spirals, and more. In: 37th International Symposium on Computational Geometry (SoCG 2021), June 7-11, 2021.

Khan, A and Maiti, A and Sharma, A and Wiese, A (2021) On guillotine separable packings for the two-dimensional geometric knapsack problem. In: 37th International Symposium on Computational Geometry, SoCG 2021, 7-11, June 2021, Virtual, Buffalo.

Deppert, MA and Jansen, K and Khan, A and Rau, M and Tutas, M (2021) Peak demand minimization via sliced strip packing. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 16-18 Aug 2021, Seattle.

Khan, A and Sharma, E (2021) Tight approximation algorithms for geometric bin packing with skewed items. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 16-18 aug 2021, Seattle.

Albers, S and Khan, A and Ladewig, L (2020) Best fit bin packing with random order revisited. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 25-26 August 2020, Prague; Czech Republic.

Khan, A and Pittu, MR (2020) On guillotine separability of squares and rectangles. In: Leibniz International Proceedings in Informatics, LIPIcs, 17-19 August 2020, Virtual, Online.