팔로우
Arindam Khan
Arindam Khan
Associate Professor, Indian Institute of Science, Bengaluru
iisc.ac.in의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Approximation and online algorithms for multidimensional bin packing: A survey
HI Christensen, A Khan, S Pokutta, P Tetali
Computer Science Review, 2017
2822017
Improved Approximation Algorithm for Two-Dimensional Bin Packing
N Bansal, A Khan
ACM-SIAM Symposium on Discrete Algorithms (SODA), 13-25, 2014
962014
Improved approximation for vector bin packing
N Bansal, M Eliáš, A Khan
Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete …, 2016
702016
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
61*2021
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
542010
Group fairness for knapsack problems
D Patel, A Khan, A Louis
arXiv preprint arXiv:2006.07832, 2020
422020
Improved online algorithms for knapsack and GAP in the random order model
S Albers, A Khan, L Ladewig
Algorithmica 83, 1750-1785, 2021
382021
On Mimicking Networks Representing Minimum Terminal Cuts
A Khan, P Raghavendra, P Tetali, LA Végh
Arxiv preprint arXiv:1207.6371, 2012
382012
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
372022
Multidimensional bin packing and other related problems: A survey
HI Christensen, A Khan, S Pokutta, P Tetali
Computer Science Review, 2016
332016
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
W Galvez, F Grandoni, S Ingala, A Khan
FSTTCS 2016, 2016
322016
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
302021
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
242023
The matching augmentation problem: a -approximation algorithm
J Cheriyan, J Dippel, F Grandoni, A Khan, VV Narayan
Mathematical Programming 182 (1), 315-354, 2020
242020
Multi-armed bandits with bounded arm-memory: Near-optimal guarantees for best-arm identification and regret minimization
A Maiti, V Patil, A Khan
Advances in Neural Information Processing Systems 34, 19553-19565, 2021
23*2021
Best fit bin packing with random order revisited
S Albers, A Khan, L Ladewig
Algorithmica 83, 2833-2858, 2021
212021
Finding fair allocations under budget constraints
S Barman, A Khan, S Shyam, KVN Sreenivas
Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5481-5489, 2023
202023
Approximation Algorithms For Multidimensional Bin Packing
A Khan
Georgia Institute of Technology, 2015
202015
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
On Discovering Bucket Orders from Preference Data
S Kenkre, A Khan, V Pandit
SIAM International Conference on Data Mining, 2011
202011
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20