Arindam Khan

Navedeno

	Vse	Od leta 2018
Navedbe	842	705
indeks h	17	15
indeks i10	22	21

200

100

150

2009201020112012201320142015201620172018201920202021202220233 2 5 10 10 11 18 27 38 47 55 95 155 194 156

Javni dostop

Prikaži vse

11 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Andreas WieseAdjoint ProfessorPreverjeni e-poštni naslov na dii.uchile.cl
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandPreverjeni e-poštni naslov na idsia.ch
Waldo GálvezAssistant Professor at Institute of Engineering Sciences, Universidad de O'HigginsPreverjeni e-poštni naslov na uoh.cl
Henrik Iskov ChristensenDirector / Professor @ UCSDPreverjeni e-poštni naslov na eng.ucsd.edu
Prasad TetaliHead, Department of Mathematical Sciences, Carnegie Mellon UniversityPreverjeni e-poštni naslov na andrew.cmu.edu
Arnab MaitiPhD student ,CSE, University of WashingtonPreverjeni e-poštni naslov na cs.washington.edu
Nikhil BansalUniversity of MichiganPreverjeni e-poštni naslov na umich.edu
Salvatore IngalaIDSIA, USI-SUPSIPreverjeni e-poštni naslov na idsia.ch
K. V. N. SreenivasStudent, Computer Science and Automation, Indian Institute of Science BengaluruPreverjeni e-poštni naslov na iisc.ac.in
Madhusudhan Reddy Pittu2nd year PhD Student in Computer Science at Carnegie Mellon UniversityPreverjeni e-poštni naslov na andrew.cmu.edu
Susanne AlbersProfessor of Computer Science, TU MuenchenPreverjeni e-poštni naslov na in.tum.de
Klaus JansenProfessor, Computer Science, University of KielPreverjeni e-poštni naslov na informatik.uni-kiel.de
Siddharth BarmanDepartment of Computer Science and Automation, IIScPreverjeni e-poštni naslov na iisc.ac.in
Eklavya SharmaUniversity of Illinois, Urbana-ChampaignPreverjeni e-poštni naslov na illinois.edu
Tobias MömkeProfessor, Computer Science, University of AugsburgPreverjeni e-poštni naslov na informatik.uni-augsburg.de
Mathieu MariPostdocPreverjeni e-poštni naslov na ens.fr
Malin RauUniversität HamburgPreverjeni e-poštni naslov na uni-hamburg.de
Vishakha PatilPhD Student, Indian Institute of SciencePreverjeni e-poštni naslov na iisc.ac.in
Carl A. GunterGeorge and Ann Fisher Distinguished Professor, University of Illinois at Urbana-ChampaignPreverjeni e-poštni naslov na illinois.edu
Omid FatemiehUniversity of Illinois at Urbana-Champaign / GooglePreverjeni e-poštni naslov na google.com

Spremljaj

Arindam Khan

Assistant Professor, Indian Institute of Science, Bengaluru

Preverjeni e-poštni naslov na iisc.ac.in - Domača stran

Approximation Algorithms Online Algorithms Computational Geometry Online Learning.


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Approximation and online algorithms for multidimensional bin packing: A survey HI Christensen, A Khan, S Pokutta, P Tetali Computer Science Review, 2017	213	2017
Improved Approximation Algorithm for Two-Dimensional Bin Packing N Bansal, A Khan ACM-SIAM Symposium on Discrete Algorithms (SODA), 13-25, 2014	74	2014
Improved approximation for vector bin packing N Bansal, M Eliáš, A Khan Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete …, 2016	59	2016
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	50	2010
Approximating geometric knapsack via L-packings W Gálvez, F Grandoni, S Heydrich, S Ingala, A Khan, A Wiese 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	33	2017
Improved online algorithms for knapsack and GAP in the random order model S Albers, A Khan, L Ladewig Algorithmica 83, 1750-1785, 2021	31	2021
On Mimicking Networks Representing Minimum Terminal Cuts A Khan, P Raghavendra, P Tetali, LA Végh Arxiv preprint arXiv:1207.6371, 2012	30	2012
Improved Pseudo-Polynomial-Time Approximation for Strip Packing W Galvez, F Grandoni, S Ingala, A Khan FSTTCS 2016, 2016	29	2016
Group fairness for knapsack problems D Patel, A Khan, A Louis arXiv preprint arXiv:2006.07832, 2020	27	2020
Multidimensional bin packing and other related problems: A survey HI Christensen, A Khan, S Pokutta, P Tetali	23	2016
On Discovering Bucket Orders from Preference Data S Kenkre, A Khan, V Pandit SIAM International Conference on Data Mining, 2011	21	2011
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	19	2022
Approximation Algorithms For Multidimensional Bin Packing A Khan Georgia Institute of Technology, 2015	19	2015
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	19	2014
A Tight -Approximation for Skewed Strip Packing W Gálvez, F Grandoni, AJ Ameli, K Jansen, A Khan, M Rau Algorithmica, 1-22, 2023	18	2023
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	17	2021
The matching augmentation problem: a -approximation algorithm J Cheriyan, J Dippel, F Grandoni, A Khan, VV Narayan Mathematical Programming 182 (1-2), 315-354, 2020	17	2020
On guillotine separability of squares and rectangles A Khan, MR Pittu Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020	16	2020
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	13	2021
Best fit bin packing with random order revisited S Albers, A Khan, L Ladewig Algorithmica 83, 2833-2858, 2021	12	2021

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji