Attribute-Based Messaging: Access Control and Confidentiality. - Rakeshbabu Bobba; Omid Fatemieh; Fariba Khan; Arindam Khan 001; Carl A. Gunter; Himanshu Khurana; Manoj Prabhakaran 001 (ACM Trans. Inf. Syst. Secur., 2010)

Discovering Bucket Orders from Data. - Vinayaka Pandit; Sreyash Kenkre; Arindam Khan 001 (SDM, 2011)

On Mimicking Networks Representing Minimum Terminal Cuts - Arindam Khan 001; Prasad Raghavendra; Prasad Tetali; László A. Végh (CoRR, 2012)

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. - Arindam Khan 001; Sudebkumar Prasant Pal; Mridul Aanjaneya; Arijit Bishnu; Subhas C. Nandy (Discret. Appl. Math., 2013)

Role of conformity in opinion dynamics in social networks. - Abhimanyu Das; Sreenivas Gollapudi; Arindam Khan 001; Renato Paes Leme (COSN, 2014)

Improved Approximation Algorithm for Two-Dimensional Bin Packing. - Nikhil Bansal 001; Arindam Khan 001 (SODA, 2014)

On mimicking networks representing minimum terminal cuts. - Arindam Khan 001; Prasad Raghavendra (Inf. Process. Lett., 2014)

On Weighted Bipartite Edge Coloring. - Arindam Khan 001; Mohit Singh (FSTTCS, 2015)

Improved Pseudo-Polynomial-Time Approximation for Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Salvatore Ingala; Arindam Khan 001 (FSTTCS, 2016)

Improved Approximation for Vector Bin Packing. - Nikhil Bansal 001; Marek Eliás 001; Arindam Khan 001 (SODA, 2016)

Approximation algorithms for multidimensional bin packing. - Arindam Khan 001 (2016)

Approximation and online algorithms for multidimensional bin packing: A survey. - Henrik I. Christensen; Arindam Khan 001; Sebastian Pokutta; Prasad Tetali (Comput. Sci. Rev., 2017)

The Matching Augmentation Problem: A 7/4-Approximation Algorithm. - Joe Cheriyan; Jack Dippel; Fabrizio Grandoni 001; Arindam Khan 001; Vishnu V. Narayan (CoRR, 2018)

On Guillotine Separability of Squares and Rectangles. - Arindam Khan 001; Madhusudhan Reddy Pittu (APPROX-RANDOM, 2020)

Streaming Algorithms for Stochastic Multi-armed Bandits. - Arnab Maiti; Vishakha Patil; Arindam Khan 001 (CoRR, 2020)

The matching augmentation problem: a $ frac{7}{4}$-approximation algorithm. - Joe Cheriyan; Jack Dippel; Fabrizio Grandoni 001; Arindam Khan 001; Vishnu V. Narayan (Math. Program., 2020)

Group Fairness for Knapsack Problems. - Deval Patel; Arindam Khan 001; Anand Louis (AAMAS, 2021)

On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. - Arindam Khan 001; Arnab Maiti; Amatya Sharma; Andreas Wiese (SoCG, 2021)

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. - Waldo Gálvez; Fabrizio Grandoni 001; Arindam Khan 001; Diego Ramírez-Romero; Andreas Wiese (SoCG, 2021)

Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. - Arnab Maiti; Vishakha Patil; Arindam Khan 001 (NeurIPS, 2021)

Improved Online Algorithms for Knapsack and GAP in the Random Order Model. - Susanne Albers; Arindam Khan 001; Leon Ladewig (Algorithmica, 2021)

Best Fit Bin Packing with Random Order Revisited. - Susanne Albers; Arindam Khan 001; Leon Ladewig (Algorithmica, 2021)

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

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (CoRR, 2021)

Approximating Geometric Knapsack via L-packings. - Waldo Gálvez; Fabrizio Grandoni 001; Salvatore Ingala; Sandy Heydrich; Arindam Khan 001; Andreas Wiese (ACM Trans. Algorithms, 2021)

Universal and Tight Online Algorithms for Generalized-Mean Welfare. - Siddharth Barman; Arindam Khan 001; Arnab Maiti (AAAI, 2022)

Approximation Algorithms for Round-UFP and Round-SAP. - Debajyoti Kar; Arindam Khan 001; Andreas Wiese (ESA, 2022)

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

Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. - Arindam Khan 001; Aditya Lonkar; Arnab Maiti; Amatya Sharma; Andreas Wiese (ICALP, 2022)

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

Fair Rank Aggregation. - Diptarka Chakraborty; Syamantak Das; Arindam Khan 001; Aditya Subramanian 001 (NeurIPS, 2022)

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (SODA, 2022)

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. - Siddharth Barman; Arindam Khan 001; Arnab Maiti; Ayush Sawarni (AAAI, 2023)

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

Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. - Arindam Khan 001; Aditya Lonkar; Saladi Rahul; Aditya Subramanian 001; Andreas Wiese (SoCG, 2023)

Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. - Vishakha Patil; Vineet Nair; Ganesh Ghalme; Arindam Khan 001 (IJCAI, 2023)

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

Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. - Arindam Khan 001; Eklavya Sharma (Algorithmica, 2023)

A Tight (3/2+ε )-Approximation for Skewed Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Klaus Jansen; Arindam Khan 001; Malin Rau (Algorithmica, 2023)

Peak Demand Minimization via Sliced Strip Packing. - Max A. Deppert; Klaus Jansen; Arindam Khan 001; Malin Rau; Malte Tutas (Algorithmica, 2023)

Random-Order Online Independent Set of Intervals and Hyperrectangles. - Mohit Garg 003; Debajyoti Kar; Arindam Khan 001 (ESA, 2024)

On Approximation Schemes for Stabbing Rectilinear Polygons. - Arindam Khan 001; Aditya Subramanian 001; Tobias Widmann; Andreas Wiese (FSTTCS, 2024)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. - Pritam Acharya; Sujoy Bhore; Aaryan Gupta; Arindam Khan 001; Bratin Mondal; Andreas Wiese (ICALP, 2024)

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

Random-Order Online Interval Scheduling and Geometric Generalizations. - Mohit Garg 003; Debajyoti Kar; Arindam Khan 001 (CoRR, 2024)

A PTAS for the horizontal rectangle stabbing problem. - Arindam Khan 001; Aditya Subramanian 001; Andreas Wiese (Math. Program., 2024)

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

Improved Approximation Algorithms for Three-Dimensional Bin Packing. - Debajyoti Kar; Arindam Khan 001; Malin Rau (ICALP, 2025)

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

Tight Approximation Algorithms for 2D Guillotine Strip Packing. - Arindam Khan 001; Aditya Lonkar; Arnab Maiti; Amatya Sharma; Andreas Wiese (ACM Trans. Algorithms, 2025)