Approximation Algorithms for Generalized Multidimensional Knapsack. - Arindam Khan 001; Eklavya Sharma; K. V. N. Sreenivas (CoRR, 2021)

Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. - Arindam Khan 001; Eklavya Sharma; K. V. N. Sreenivas (FSTTCS, 2022)

A PTAS for Packing Hypercubes into a Knapsack. - Klaus Jansen; Arindam Khan 001; Marvin Lira; K. V. N. Sreenivas (ICALP, 2022)

Finding Fair Allocations under Budget Constraints. - Siddharth Barman; Arindam Khan 001; Sudarshan Shyam; K. V. N. Sreenivas (AAAI, 2023)

Guaranteeing Envy-Freeness under Generalized Assignment Constraints. - Siddharth Barman; Arindam Khan 001; Sudarshan Shyam; K. V. N. Sreenivas (EC, 2023)

Bin Packing under Random-Order: Breaking the Barrier of 3/2. - Anish Hebbar; Arindam Khan 001; K. V. N. Sreenivas (SODA, 2024)

Improved Approximation Algorithms for Three-Dimensional Knapsack. - Klaus Jansen; Debajyoti Kar; Arindam Khan 001; K. V. N. Sreenivas; Malte Tutas (SoCG, 2025)

Near-optimal Algorithms for Stochastic Online Bin Packing. - Nikhil Ayyadevara; Rajni Dabas; Arindam Khan 001; K. V. N. Sreenivas (ACM Trans. Algorithms, 2025)