Arindam Khan

Orcid: 0000-0001-7505-1687

Affiliations:
  • Indian Institute of Science, Bengaluru, India
  • Dalle Molle Institute for Artificial Intelligence Research (IDSIA), Lugano, Switzerland (former)
  • Georgia Institute of Technology, College of Computing (former)


According to our database1, Arindam Khan authored at least 45 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Random-Order Online Interval Scheduling and Geometric Generalizations.
CoRR, 2024

On Approximation Schemes for Stabbing Rectilinear Polygons.
CoRR, 2024

Bin Packing under Random-Order: Breaking the Barrier of 3/2.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Peak Demand Minimization via Sliced Strip Packing.
Algorithmica, December, 2023

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

Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items.
Algorithmica, September, 2023

Guaranteeing Envy-Freeness under Generalized Assignment Constraints.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Finding Fair Allocations under Budget Constraints.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

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

A PTAS for the Horizontal Rectangle Stabbing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

A PTAS for Packing Hypercubes into a Knapsack.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Near-Optimal Algorithms for Stochastic Online Bin Packing.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing.
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.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Universal and Tight Online Algorithms for Generalized-Mean Welfare.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Approximating Geometric Knapsack via L-packings.
ACM Trans. Algorithms, 2021

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

Approximation Algorithms for Generalized Multidimensional Knapsack.
CoRR, 2021

Best Fit Bin Packing with Random Order Revisited.
Algorithmica, 2021

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

Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization.
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.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Group Fairness for Knapsack Problems.
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.
Math. Program., 2020

Streaming Algorithms for Stochastic Multi-armed Bandits.
CoRR, 2020

On Guillotine Separability of Squares and Rectangles.
Proceedings of the Approximation, 2020

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

2017
Approximation and online algorithms for multidimensional bin packing: A survey.
Comput. Sci. Rev., 2017

2016
Approximation algorithms for multidimensional bin packing.
PhD thesis, 2016

Improved Approximation for Vector Bin Packing.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Improved Pseudo-Polynomial-Time Approximation for Strip Packing.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
On Weighted Bipartite Edge Coloring.
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.
Inf. Process. Lett., 2014

Improved Approximation Algorithm for Two-Dimensional Bin Packing.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Role of conformity in opinion dynamics in social networks.
Proceedings of the second ACM conference on Online social networks, 2014

2013
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons.
Discret. Appl. Math., 2013

2012
On Mimicking Networks Representing Minimum Terminal Cuts
CoRR, 2012

2011
Discovering Bucket Orders from Data.
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

2010
Attribute-Based Messaging: Access Control and Confidentiality.
ACM Trans. Inf. Syst. Secur., 2010


  Loading...