Arindam Khan

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 69

Top Venues

Georgia Institute of Technology, Atlanta, GA, USA (PHD)

Education History

Georgia Institute of Technology, Atlanta, GA, USA

PHD

Publications

Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese
On Approximation Schemes for Stabbing Rectilinear Polygons. CoRR (2024)
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. CoRR (2024)
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
Bin Packing under Random-Order: Breaking the Barrier of 3/2. CoRR (2024)
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
Bin Packing under Random-Order: Breaking the Barrier of 3/2. SODA (2024)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the horizontal rectangle stabbing problem. Math. Program. 206 (1) (2024)
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. ICALP (2024)
Mohit Garg, Debajyoti Kar, Arindam Khan
Random-Order Online Interval Scheduling and Geometric Generalizations. CoRR (2024)
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. SoCG (2023)
Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas
Peak Demand Minimization via Sliced Strip Packing. Algorithmica 85 (12) (2023)
Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. IJCAI (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Finding Fair Allocations under Budget Constraints. AAAI (2023)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR (2023)
Arindam Khan, Eklavya Sharma
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. Algorithmica 85 (9) (2023)
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. CoRR (2023)
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI (2023)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85 (10) (2023)
Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian
Fair Rank Aggregation. CoRR (2023)
Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian
Fair Rank Aggregation. NeurIPS (2022)
Debajyoti Kar, Arindam Khan, Andreas Wiese
Approximation Algorithms for ROUND-UFP and ROUND-SAP. CoRR (2022)
Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas
A PTAS for Packing Hypercubes into a Knapsack. CoRR (2022)
Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
Finding Fair Allocations under Budget Constraints. CoRR (2022)
Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. CoRR (2022)
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas
Near-optimal Algorithms for Stochastic Online Bin Packing. CoRR (2022)
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas
Near-Optimal Algorithms for Stochastic Online Bin Packing. ICALP (2022)
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. ICALP (2022)
Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas
A PTAS for Packing Hypercubes into a Knapsack. ICALP (2022)
Debajyoti Kar, Arindam Khan, Andreas Wiese
Approximation Algorithms for Round-UFP and Round-SAP. ESA (2022)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the Horizontal Rectangle Stabbing Problem. IPCO (2022)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA (2022)
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. FSTTCS (2022)
Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR (2022)
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing. CoRR (2022)
Siddharth Barman, Arindam Khan, Arnab Maiti
Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI (2022)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17 (4) (2021)
Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas
Peak Demand Minimization via Sliced Strip Packing. APPROX-RANDOM (2021)
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
Approximation Algorithms for Generalized Multidimensional Knapsack. CoRR (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. CoRR (2021)
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem. CoRR (2021)
Susanne Albers, Arindam Khan, Leon Ladewig
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. Algorithmica 83 (6) (2021)
Susanne Albers, Arindam Khan, Leon Ladewig
Best Fit Bin Packing with Random Order Revisited. Algorithmica 83 (9) (2021)
Siddharth Barman, Arindam Khan, Arnab Maiti
Universal and Tight Online Algorithms for Generalized-Mean Welfare. CoRR (2021)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the horizontal rectangle stabbing problem. CoRR (2021)
Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas
Peak Demand Minimization via Sliced Strip Packing. CoRR (2021)
Arindam Khan, Eklavya Sharma
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. CoRR (2021)
Arindam Khan, Eklavya Sharma
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. APPROX-RANDOM (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG (2021)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR (2021)
Deval Patel, Arindam Khan, Anand Louis
Group Fairness for Knapsack Problems. AAMAS (2021)
Arnab Maiti, Vishakha Patil, Arindam Khan
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. NeurIPS (2021)
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. SoCG (2021)
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. CoRR (2021)
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan
The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm. Math. Program. 182 (1) (2020)
Arindam Khan, Madhusudhan Reddy Pittu
On Guillotine Separability of Squares and Rectangles. APPROX-RANDOM (2020)
Susanne Albers, Arindam Khan, Leon Ladewig
Best Fit Bin Packing with Random Order Revisited. MFCS (2020)
Arnab Maiti, Vishakha Patil, Arindam Khan
Streaming Algorithms for Stochastic Multi-armed Bandits. CoRR (2020)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM (2020)
Susanne Albers, Arindam Khan, Leon Ladewig
Best Fit Bin Packing with Random Order Revisited. CoRR (2020)
Susanne Albers, Arindam Khan, Leon Ladewig
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. CoRR (2020)
Deval Patel, Arindam Khan, Anand Louis
Group Fairness for Knapsack Problems. CoRR (2020)
Susanne Albers, Arindam Khan, Leon Ladewig
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. APPROX-RANDOM (2019)
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan
The Matching Augmentation Problem: A 7/4-Approximation Algorithm. CoRR (2018)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. CoRR (2018)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-Packings. FOCS (2017)
Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, Prasad Tetali
Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev. 24 (2017)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. CoRR (2017)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS (2016)
Nikhil Bansal, Marek Eliás, Arindam Khan
Improved Approximation for Vector Bin Packing. SODA (2016)
Arindam Khan, Mohit Singh
On Weighted Bipartite Edge Coloring. FSTTCS (2015)
Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, Renato Paes Leme
Role of conformity in opinion dynamics in social networks. COSN (2014)
Arindam Khan, Prasad Raghavendra
On mimicking networks representing minimum terminal cuts. Inf. Process. Lett. 114 (7) (2014)
Nikhil Bansal, Arindam Khan
Improved Approximation Algorithm for Two-Dimensional Bin Packing. SODA (2014)
Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discret. Appl. Math. 161 (10-11) (2013)
Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh
On Mimicking Networks Representing Minimum Terminal Cuts CoRR (2012)
Vinayaka Pandit, Sreyash Kenkre, Arindam Khan
Discovering Bucket Orders from Data. SDM (2011)
Rakeshbabu Bobba, Omid Fatemieh, Fariba Khan, Arindam Khan, Carl A. Gunter, Himanshu Khurana, Manoj Prabhakaran
Attribute-Based Messaging: Access Control and Confidentiality. ACM Trans. Inf. Syst. Secur. 13 (4) (2010)

Arindam Khan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arindam Khan