default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArindam Khan 0001
Person information
- affiliation: Indian Institute of Science, Bengaluru, India
- affiliation (former): Dalle Molle Institute for Artificial Intelligence Research (IDSIA), Lugano, Switzerland
- affiliation (former): Georgia Institute of Technology, College of Computing
Other persons with the same name
- Arindam Khan 0002 — Bhabha Atomic Research Centre, Mumbai
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the horizontal rectangle stabbing problem. Math. Program. 206(1): 607-630 (2024)- [c35]Mohit Garg, Debajyoti Kar, Arindam Khan:
Random-Order Online Independent Set of Intervals and Hyperrectangles. ESA 2024: 58:1-58:18 - [c34]Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese:
On Approximation Schemes for Stabbing Rectilinear Polygons. FSTTCS 2024: 27:1-27:18 - [c33]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: 8:1-8:20 - [c32]Anish Hebbar, Arindam Khan, K. V. N. Sreenivas:
Bin Packing under Random-Order: Breaking the Barrier of 3/2. SODA 2024: 4177-4219 - [i31]Anish Hebbar, Arindam Khan, K. V. N. Sreenivas:
Bin Packing under Random-Order: Breaking the Barrier of 3/2. CoRR abs/2401.04714 (2024) - [i30]Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese:
On Approximation Schemes for Stabbing Rectilinear Polygons. CoRR abs/2402.02412 (2024) - [i29]Mohit Garg, Debajyoti Kar, Arindam Khan:
Random-Order Online Interval Scheduling and Geometric Generalizations. CoRR abs/2402.14201 (2024) - [i28]Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese:
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. CoRR abs/2404.03981 (2024) - 2023
- [j11]Arindam Khan, Eklavya Sharma
:
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. Algorithmica 85(9): 2735-2778 (2023) - [j10]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): 3088-3109 (2023) - [j9]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. Algorithmica 85(12): 3649-3679 (2023) - [c31]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Finding Fair Allocations under Budget Constraints. AAAI 2023: 5481-5489 - [c30]Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni:
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI 2023: 6762-6769 - [c29]Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. SoCG 2023: 46:1-46:17 - [c28]Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan:
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. IJCAI 2023: 4100-4108 - [c27]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC 2023: 242-269 - [i27]Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. CoRR abs/2303.09524 (2023) - [i26]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR abs/2305.01339 (2023) - [i25]Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian:
Fair Rank Aggregation. CoRR abs/2308.10499 (2023) - 2022
- [c26]Siddharth Barman, Arindam Khan, Arnab Maiti:
Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI 2022: 4793-4800 - [c25]Debajyoti Kar, Arindam Khan, Andreas Wiese:
Approximation Algorithms for Round-UFP and Round-SAP. ESA 2022: 71:1-71:19 - [c24]Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. FSTTCS 2022: 23:1-23:22 - [c23]Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas:
Near-Optimal Algorithms for Stochastic Online Bin Packing. ICALP 2022: 12:1-12:20 - [c22]Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas:
A PTAS for Packing Hypercubes into a Knapsack. ICALP 2022: 78:1-78:20 - [c21]Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese:
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. ICALP 2022: 80:1-80:20 - [c20]Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the Horizontal Rectangle Stabbing Problem. IPCO 2022: 361-374 - [c19]Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian:
Fair Rank Aggregation. NeurIPS 2022 - [c18]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: 894-905 - [i24]Debajyoti Kar, Arindam Khan, Andreas Wiese:
Approximation Algorithms for ROUND-UFP and ROUND-SAP. CoRR abs/2202.03492 (2022) - [i23]Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese:
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing. CoRR abs/2202.05989 (2022) - [i22]Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas:
A PTAS for Packing Hypercubes into a Knapsack. CoRR abs/2202.11902 (2022) - [i21]Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas:
Near-optimal Algorithms for Stochastic Online Bin Packing. CoRR abs/2205.03622 (2022) - [i20]Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni:
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR abs/2205.13930 (2022) - [i19]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Finding Fair Allocations under Budget Constraints. CoRR abs/2208.08168 (2022) - [i18]Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan:
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. CoRR abs/2208.09254 (2022) - 2021
- [j8]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. Algorithmica 83(6): 1750-1785 (2021) - [j7]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. Algorithmica 83(9): 2833-2858 (2021) - [j6]Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17(4): 33:1-33:67 (2021) - [c17]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. APPROX-RANDOM 2021: 21:1-21:24 - [c16]Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. APPROX-RANDOM 2021: 22:1-22:23 - [c15]Deval Patel, Arindam Khan, Anand Louis:
Group Fairness for Knapsack Problems. AAMAS 2021: 1001-1009 - [c14]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: 39:1-39:17 - [c13]Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese:
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. SoCG 2021: 48:1-48:17 - [c12]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: 19553-19565 - [i17]Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Approximation Algorithms for Generalized Multidimensional Knapsack. CoRR abs/2102.05854 (2021) - [i16]Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese:
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem. CoRR abs/2103.09735 (2021) - [i15]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 abs/2103.10406 (2021) - [i14]Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. CoRR abs/2105.02827 (2021) - [i13]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. CoRR abs/2105.07219 (2021) - [i12]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 abs/2106.00623 (2021) - [i11]Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. CoRR abs/2106.13951 (2021) - [i10]Siddharth Barman, Arindam Khan, Arnab Maiti:
Universal and Tight Online Algorithms for Generalized-Mean Welfare. CoRR abs/2109.00874 (2021) - [i9]Arindam Khan, Aditya Subramanian, Andreas Wiese:
A PTAS for the horizontal rectangle stabbing problem. CoRR abs/2111.05197 (2021) - 2020
- [j5]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): 315-354 (2020) - [c11]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: 44:1-44:18 - [c10]Arindam Khan, Madhusudhan Reddy Pittu:
On Guillotine Separability of Squares and Rectangles. APPROX-RANDOM 2020: 47:1-47:22 - [c9]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. MFCS 2020: 7:1-7:15 - [i8]Deval Patel, Arindam Khan, Anand Louis:
Group Fairness for Knapsack Problems. CoRR abs/2006.07832 (2020) - [i7]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. CoRR abs/2012.00497 (2020) - [i6]Susanne Albers, Arindam Khan, Leon Ladewig:
Best Fit Bin Packing with Random Order Revisited. CoRR abs/2012.00511 (2020) - [i5]Arnab Maiti, Vishakha Patil, Arindam Khan:
Streaming Algorithms for Stochastic Multi-armed Bandits. CoRR abs/2012.05142 (2020)
2010 – 2019
- 2019
- [c8]Susanne Albers, Arindam Khan, Leon Ladewig:
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. APPROX-RANDOM 2019: 22:1-22:23 - 2018
- [i4]Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan:
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. CoRR abs/1801.07541 (2018) - [i3]Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan:
The Matching Augmentation Problem: A 7/4-Approximation Algorithm. CoRR abs/1810.07816 (2018) - 2017
- [j4]Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, Prasad Tetali:
Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev. 24: 63-79 (2017) - [c7]Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-Packings. FOCS 2017: 260-271 - [i2]Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-packings. CoRR abs/1711.07710 (2017) - 2016
- [b1]Arindam Khan:
Approximation algorithms for multidimensional bin packing. Georgia Institute of Technology, Atlanta, GA, USA, 2016 - [c6]Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan:
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS 2016: 9:1-9:14 - [c5]Nikhil Bansal, Marek Eliás, Arindam Khan:
Improved Approximation for Vector Bin Packing. SODA 2016: 1561-1579 - 2015
- [c4]Arindam Khan, Mohit Singh:
On Weighted Bipartite Edge Coloring. FSTTCS 2015: 136-150 - 2014
- [j3]Arindam Khan, Prasad Raghavendra:
On mimicking networks representing minimum terminal cuts. Inf. Process. Lett. 114(7): 365-371 (2014) - [c3]Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, Renato Paes Leme:
Role of conformity in opinion dynamics in social networks. COSN 2014: 25-36 - [c2]Nikhil Bansal, Arindam Khan:
Improved Approximation Algorithm for Two-Dimensional Bin Packing. SODA 2014: 13-25 - 2013
- [j2]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): 1496-1505 (2013) - 2012
- [i1]Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh:
On Mimicking Networks Representing Minimum Terminal Cuts. CoRR abs/1207.6371 (2012) - 2011
- [c1]Vinayaka Pandit, Sreyash Kenkre, Arindam Khan:
Discovering Bucket Orders from Data. SDM 2011: 872-883 - 2010
- [j1]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): 31:1-31:35 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
