AK
Arindam Khan
cs.DScs.CGcs.GTcs.LGcs.AIcs.CLcs.ITmath.ITOnline algorithmsOnline bin packing
On Valency
published · living versionsW_5nrunufu·v1 · currentpublished
Preprints & journals
35 papers in the corpus · 2012–2026On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares2607.24147v2 · Mark de Berg, Debajyoti Kar, Arindam Khan et al.2026 · 0 citationsarXiv
Online Geometric Packing through Online TSP Scheduling2607.22179v1 · Anders Aamand, Mikkel Abrahamsen, Simon Bartlmae et al.2026 · 0 citationsarXiv
Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations2603.23970v3 · Debajyoti Kar, Arindam Khan, Andreas Wiese2026 · 0 citationsarXiv
Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models2509.20304v1 · Kailash Gopal Darmasubramanian, Akash Pareek, Arindam Khan et al.2025 · 0 citationsarXiv
Improved Approximation Algorithms for Three-Dimensional Knapsack2503.19365v1 · Klaus Jansen, Debajyoti Kar, Arindam Khan et al.2025 · 1 citationarXiv
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects2404.03981v2 · Pritam Acharya, Sujoy Bhore, Aaryan Gupta et al.2024 · 1 citationarXiv
Random-Order Online Independent Set of Intervals and Hyperrectangles2402.14201v2 · Mohit Garg, Debajyoti Kar, Arindam Khan2024 · 1 citationarXiv
On Approximation Schemes for Stabbing Rectilinear Polygons2402.02412v1 · Arindam Khan, Aditya Subramanian, Tobias Widmann et al.2024 · 2 citationsarXiv
Bin Packing under Random-Order: Breaking the Barrier of 3/22401.04714v1 · Anish Hebbar, Arindam Khan, K. V. N. Sreenivas2024 · 3 citationsarXiv
Fair Rank Aggregation2308.10499v1 · Diptarka Chakraborty, Syamantak Das, Arindam Khan et al.2023 · 4 citationsarXiv
Guaranteeing Envy-Freeness under Generalized Assignment Constraints2305.01339v1 · Siddharth Barman, Arindam Khan, Sudarshan Shyam et al.2023 · 11 citationsarXiv
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set2303.09524v1 · Arindam Khan, Aditya Lonkar, Saladi Rahul et al.2023 · 5 citationsarXiv
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits2208.09254v1 · Vishakha Patil, Vineet Nair, Ganesh Ghalme et al.2022 · 3 citationsarXiv
Finding Fair Allocations under Budget Constraints2208.08168v2 · Siddharth Barman, Arindam Khan, Sudarshan Shyam et al.2022 · 16 citationsarXiv
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits2205.13930v1 · Siddharth Barman, Arindam Khan, Arnab Maiti et al.2022 · 4 citationsarXiv
Near-optimal Algorithms for Stochastic Online Bin Packing2205.03622v2 · Nikhil Ayyadevara, Rajni Dabas, Arindam Khan et al.2022 · 4 citationsarXiv
A PTAS for Packing Hypercubes into a Knapsack2202.11902v2 · Klaus Jansen, Arindam Khan, Marvin Lira et al.2022 · 2 citationsarXiv
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing2202.05989v3 · Arindam Khan, Aditya Lonkar, Arnab Maiti et al.2022 · 1 citationarXiv
Approximation Algorithms for ROUND-UFP and ROUND-SAP2202.03492v1 · Debajyoti Kar, Arindam Khan, Andreas Wiese2022 · 2 citationsarXiv
A PTAS for the horizontal rectangle stabbing problem2111.05197v1 · Arindam Khan, Aditya Subramanian, Andreas Wiese2021 · 3 citationsarXiv
Universal and Tight Online Algorithms for Generalized-Mean Welfare2109.00874v1 · Siddharth Barman, Arindam Khan, Arnab Maiti2021 · 10 citationsarXiv
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing2106.13951v1 · Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas2021 · 4 citationsarXiv
A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles2106.00623v3 · Waldo G'alvez, Arindam Khan, Mathieu Mari et al.2021 · 1 citationarXiv
Peak Demand Minimization via Sliced Strip Packing2105.07219v1 · Max A. Deppert, Klaus Jansen, Arindam Khan et al.2021 · 8 citationsarXiv
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items2105.02827v1 · Arindam Khan, Eklavya Sharma2021 · 6 citationsarXiv
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More2103.10406v1 · Waldo G'alvez, Fabrizio Grandoni, Arindam Khan et al.2021 · 12 citationsarXiv
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem2103.09735v1 · Arindam Khan, Arnab Maiti, Amatya Sharma et al.2021 · 11 citationsarXiv
Approximation Algorithms for Generalized Multidimensional Knapsack2102.05854v1 · Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas2021 · 3 citationsarXiv
Improved Online Algorithms for Knapsack and GAP in the Random Order Model.34720295 · Albers, Susanne, Khan, Arindam, Ladewig, Leon2021 · 29 citationsAlgorithmica. 2021;83(6):1750-1785
Best Fit Bin Packing with Random Order Revisited.34776569 · Albers, Susanne, Khan, Arindam, Ladewig, Leon2021 · 18 citationsAlgorithmica. 2021;83(9):2833-2858
Streaming Algorithms for Stochastic Multi-armed Bandits2012.05142v1 · Arnab Maiti, Vishakha Patil, Arindam Khan2020 · 0 citationsarXiv
Group Fairness for Knapsack Problems2006.07832v3 · Deval Patel, Arindam Khan, Anand Louis2020 · 13 citationsarXiv
Improved Pseudo-Polynomial-Time Approximation for Strip Packing1801.07541v1 · Waldo G'alvez, Fabrizio Grandoni, Salvatore Ingala et al.2018 · 22 citationsarXiv
Approximating Geometric Knapsack via L-packings1711.07710v1 · Waldo G'alvez, Fabrizio Grandoni, Sandy Heydrich et al.2017 · 35 citationsarXiv
On Mimicking Networks Representing Minimum Terminal Cuts1207.6371v1 · Arindam Khan, Prasad Raghavendra, Prasad Tetali et al.2012 · 30 citationsarXiv
Career total: 75 works. 35 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.