Arindam Khan

According to our database, Arindam Khan authored at least 47 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A PTAS for the horizontal rectangle stabbing problem.

Arindam Khan, Aditya Subramanian, Andreas Wiese

Math. Program., July, 2024

Random-Order Online Interval Scheduling and Geometric Generalizations.

Mohit Garg, Debajyoti Kar, Arindam Khan

CoRR, 2024

On Approximation Schemes for Stabbing Rectilinear Polygons.

Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese

CoRR, 2024

Bin Packing under Random-Order: Breaking the Barrier of 3/2.

Anish Hebbar, Arindam Khan, K. V. N. Sreenivas

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects.

Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Random-Order Online Independent Set of Intervals and Hyperrectangles.

Mohit Garg, Debajyoti Kar, Arindam Khan

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Peak Demand Minimization via Sliced Strip Packing.

Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas

Algorithmica, December, 2023

A Tight (3/2+ε )-Approximation for Skewed Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau

Algorithmica, October, 2023

Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items.

Arindam Khan, Eklavya Sharma

Algorithmica, September, 2023

Guaranteeing Envy-Freeness under Generalized Assignment Constraints.

Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits.

Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set.

Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Finding Fair Allocations under Budget Constraints.

Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits.

Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.

Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Fair Rank Aggregation.

Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A PTAS for Packing Hypercubes into a Knapsack.

Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Near-Optimal Algorithms for Stochastic Online Bin Packing.

Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing.

Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing.

Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Approximation Algorithms for Round-UFP and Round-SAP.

Debajyoti Kar, Arindam Khan, Andreas Wiese

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Universal and Tight Online Algorithms for Generalized-Mean Welfare.

Siddharth Barman, Arindam Khan, Arnab Maiti

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Approximating Geometric Knapsack via L-packings.

Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese

ACM Trans. Algorithms, 2021

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles.

Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese

CoRR, 2021

Approximation Algorithms for Generalized Multidimensional Knapsack.

Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas

CoRR, 2021

Best Fit Bin Packing with Random Order Revisited.

Susanne Albers, Arindam Khan, Leon Ladewig

Algorithmica, 2021

Improved Online Algorithms for Knapsack and GAP in the Random Order Model.

Susanne Albers, Arindam Khan, Leon Ladewig

Algorithmica, 2021

Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization.

Arnab Maiti, Vishakha Patil, Arindam Khan

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.

Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese

Proceedings of the 37th International Symposium on Computational Geometry, 2021

On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.

Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Group Fairness for Knapsack Problems.

Deval Patel, Arindam Khan, Anand Louis

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm.

Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan

Math. Program., 2020

Streaming Algorithms for Stochastic Multi-armed Bandits.

Arnab Maiti, Vishakha Patil, Arindam Khan

CoRR, 2020

On Guillotine Separability of Squares and Rectangles.

Arindam Khan, Madhusudhan Reddy Pittu

Proceedings of the Approximation, 2020

2018

The Matching Augmentation Problem: A 7/4-Approximation Algorithm.

Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan

CoRR, 2018

2017

Approximation and online algorithms for multidimensional bin packing: A survey.

Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, Prasad Tetali

Comput. Sci. Rev., 2017

2016

Approximation algorithms for multidimensional bin packing.

Arindam Khan

PhD thesis, 2016

Improved Approximation for Vector Bin Packing.

Nikhil Bansal, Marek Eliás, Arindam Khan

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Improved Pseudo-Polynomial-Time Approximation for Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

On Weighted Bipartite Edge Coloring.

Arindam Khan, Mohit Singh

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

On mimicking networks representing minimum terminal cuts.

Arindam Khan, Prasad Raghavendra

Inf. Process. Lett., 2014

Improved Approximation Algorithm for Two-Dimensional Bin Packing.

Nikhil Bansal, Arindam Khan

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Role of conformity in opinion dynamics in social networks.

Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, Renato Paes Leme

Proceedings of the second ACM conference on Online social networks, 2014

2013

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons.

Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy

Discret. Appl. Math., 2013

2012

On Mimicking Networks Representing Minimum Terminal Cuts

Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh

CoRR, 2012

2011

Discovering Bucket Orders from Data.

Vinayaka Pandit, Sreyash Kenkre, Arindam Khan

Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

2010

Attribute-Based Messaging: Access Control and Confidentiality.

Rakeshbabu Bobba, Omid Fatemieh, Fariba Khan, Arindam Khan, Carl A. Gunter, Himanshu Khurana, Manoj Prabhakaran

ACM Trans. Inf. Syst. Secur., 2010