Arindam Khan

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