Obserwuj
Arindam Khan
Arindam Khan
Assistant Professor, Indian Institute of Science, Bengaluru
Zweryfikowany adres z iisc.ac.in - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Approximation and online algorithms for multidimensional bin packing: A survey
HI Christensen, A Khan, S Pokutta, P Tetali
Computer Science Review, 2017
2392017
Improved Approximation Algorithm for Two-Dimensional Bin Packing
N Bansal, A Khan
ACM-SIAM Symposium on Discrete Algorithms (SODA), 13-25, 2014
822014
Improved approximation for vector bin packing
N Bansal, M Eliáš, A Khan
Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete …, 2016
652016
Attribute-based messaging: Access control and confidentiality
R Bobba, O Fatemieh, F Khan, A Khan, CA Gunter, H Khurana, ...
ACM Transactions on Information and System Security (TISSEC) 13 (4), 1-35, 2010
512010
Approximating geometric knapsack via l-packings
W Gálvez, F Grandoni, S Ingala, S Heydrich, A Khan, A Wiese
ACM Transactions on Algorithms (TALG) 17 (4), 1-67, 2021
49*2021
On Mimicking Networks Representing Minimum Terminal Cuts
A Khan, P Raghavendra, P Tetali, LA Végh
Arxiv preprint arXiv:1207.6371, 2012
352012
Improved online algorithms for knapsack and GAP in the random order model
S Albers, A Khan, L Ladewig
Algorithmica 83, 1750-1785, 2021
342021
Group fairness for knapsack problems
D Patel, A Khan, A Louis
arXiv preprint arXiv:2006.07832, 2020
322020
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
W Galvez, F Grandoni, S Ingala, A Khan
FSTTCS 2016, 2016
302016
Multidimensional bin packing and other related problems: A survey
HI Christensen, A Khan, S Pokutta, P Tetali
272016
A 3-approximation algorithm for maximum independent set of rectangles
W Gálvez, A Khan, M Mari, T Mömke, MR Pittu, A Wiese
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
242022
Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple l-shapes, spirals, and more
W Gálvez, F Grandoni, A Khan, D Ramírez-Romero, A Wiese
arXiv preprint arXiv:2103.10406, 2021
232021
A Tight -Approximation for Skewed Strip Packing
W Gálvez, F Grandoni, AJ Ameli, K Jansen, A Khan, M Rau
Algorithmica 85 (10), 3088-3109, 2023
222023
On Discovering Bucket Orders from Preference Data
S Kenkre, A Khan, V Pandit
SIAM International Conference on Data Mining, 2011
212011
Role of Conformity in Opinion Dynamics in Social Networks
A Das, S Gollapudi, A Khan, RP Leme
ACM Conference on Online Social Networks (COSN), 2014
202014
Approximation Algorithms For Multidimensional Bin Packing
A Khan
Georgia Institute of Technology, 2015
192015
On guillotine separability of squares and rectangles
A Khan, MR Pittu
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
182020
A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
W Gálvez, A Khan, M Mari, T Mömke, M Reddy, A Wiese
arXiv preprint arXiv:2106.00623, 2021
172021
On guillotine separable packings for the two-dimensional geometric knapsack problem
A Khan, A Maiti, A Sharma, A Wiese
arXiv preprint arXiv:2103.09735, 2021
172021
The matching augmentation problem: a -approximation algorithm
J Cheriyan, J Dippel, F Grandoni, A Khan, VV Narayan
Mathematical Programming 182 (1), 315-354, 2020
172020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20