| 2026 | STOC | Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations. | Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2025 | ICALP | Improved Approximation Algorithms for Three-Dimensional Bin Packing. | Debajyoti Kar, Arindam Khan, Malin Rau |
| 2024 | ESA | Random-Order Online Independent Set of Intervals and Hyperrectangles. | Mohit Garg, Debajyoti Kar, Arindam Khan |
| 2024 | ICALP | Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. | Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese |
| 2024 | SODA | Bin Packing under Random-Order: Breaking the Barrier of 3/2. | Anish Hebbar, Arindam Khan, K. V. N. Sreenivas |
| 2023 | AAAI | Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. | Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni |
| 2023 | AAAI | Finding Fair Allocations under Budget Constraints. | Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas |
| 2023 | IJCAI | Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. | Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan |
| 2022 | AAAI | Universal and Tight Online Algorithms for Generalized-Mean Welfare. | Siddharth Barman, Arindam Khan, Arnab Maiti |
| 2022 | ESA | Approximation Algorithms for Round-UFP and Round-SAP. | Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2022 | ICALP | Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. | Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese |
| 2022 | ICALP | Near-Optimal Algorithms for Stochastic Online Bin Packing. | Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas |
| 2022 | ICALP | A PTAS for Packing Hypercubes into a Knapsack. | Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas |
| 2022 | IPCO | A PTAS for the Horizontal Rectangle Stabbing Problem. | Arindam Khan, Aditya Subramanian, Andreas Wiese |
| 2022 | SODA | A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. | Waldo Glvez, Arindam Khan, Mathieu Mari, Tobias Mmke, Madhusudhan Reddy Pittu, Andreas Wiese |
| 2020 | MFCS | Best Fit Bin Packing with Random Order Revisited. | Susanne Albers, Arindam Khan, Leon Ladewig |
| 2017 | FOCS | Approximating Geometric Knapsack via L-Packings. | Waldo Glvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese |
| 2017 | TrustCom | Design and Analysis of a Modified Remote Attestation Protocol. | Monika Santra, Sateesh Kumar Peddoju, A. K. Bhattacharjee, Arindam Khan |
| 2016 | SODA | Improved Approximation for Vector Bin Packing. | Nikhil Bansal, Marek Elis, Arindam Khan |
| 2014 | SODA | Improved Approximation Algorithm for Two-Dimensional Bin Packing. | Nikhil Bansal, Arindam Khan |
| 2011 | SDM | Discovering Bucket Orders from Data. | Vinayaka Pandit, Sreyash Kenkre, Arindam Khan |