Tight bounds for online vector bin packing. - Yossi Azar; Ilan Reuven Cohen; Seny Kamara; F. Bruce Shepherd (STOC, 2013)

Online Covering with Convex Objectives and Applications. - Yossi Azar; Ilan Reuven Cohen; Debmalya Panigrahi (CoRR, 2014)

Serving in the Dark should be done Non-Uniformly. - Yossi Azar; Ilan Reuven Cohen (ICALP (1), 2015)

Pricing Online Decisions: Beyond Auctions. - Ilan Reuven Cohen; Alon Eden; Amos Fiat; Lukasz Jez (SODA, 2015)

Online Algorithms for Covering and Packing Problems with Convex Objectives. - Yossi Azar; Niv Buchbinder; T.-H. Hubert Chan; Shahar Chen; Ilan Reuven Cohen; Anupam Gupta 001; Zhiyi Huang 002; Ning Kang 001; Viswanath Nagarajan; Joseph Naor; Debmalya Panigrahi (FOCS, 2016)

Packing Small Vectors. - Yossi Azar; Ilan Reuven Cohen; Amos Fiat; Alan Roytman (SODA, 2016)

Online Packing and Covering Problems - Ilan Reuven Cohen (2016)

Online Lower Bounds via Duality. - Yossi Azar; Ilan Reuven Cohen; Alan Roytman (SODA, 2017)

Randomized Algorithms for Online Vector Load Balancing. - Yossi Azar; Ilan Reuven Cohen; Debmalya Panigrahi (SODA, 2018)

Randomized Online Matching in Regular Graphs. - Ilan Reuven Cohen; David Wajc (SODA, 2018)

Dynamic Pricing of Servers on Trees. - Ilan Reuven Cohen; Alon Eden; Amos Fiat; Lukasz Jez (APPROX-RANDOM, 2019)

Tight Bounds for Online Edge Coloring. - Ilan Reuven Cohen; Binghui Peng; David Wajc (FOCS, 2019)

Stochastic Graph Exploration. - Aris Anagnostopoulos; Ilan Reuven Cohen; Stefano Leonardi 001; Jakub Lacki (ICALP, 2019)

Online Two-Dimensional Load Balancing. - Ilan Reuven Cohen; Sungjin Im; Debmalya Panigrahi (ICALP, 2020)

An Asymptotic Lower Bound for Online Vector Bin Packing. - Nikhil Bansal 001; Ilan Reuven Cohen (CoRR, 2020)

Truly Asymptotic Lower Bounds for Online Vector Bin Packing. - János Balogh; Ilan Reuven Cohen; Leah Epstein; Asaf Levin (APPROX-RANDOM, 2021)

Contention Resolution, Matrix Scaling and Fair Allocation. - Nikhil Bansal 001; Ilan Reuven Cohen (WAOA, 2021)

Weighted Completion Time Minimization for Capacitated Parallel Machines. - Ilan Reuven Cohen; Izack Cohen; Iyar Zaks (WAOA, 2021)

Stochastic Graph Exploration with Limited Resources. - Ilan Reuven Cohen (WAOA, 2022)

Primal-Dual Schemes for Online Matching in Bounded Degree Graphs. - Ilan Reuven Cohen; Binghui Peng (ESA, 2023)

A General Framework for Learning-Augmented Online Allocation. - Ilan Reuven Cohen; Debmalya Panigrahi (ICALP, 2023)

The loss of serving in the dark. - Yossi Azar; Ilan Reuven Cohen; Iftah Gamzu (Inf. Process. Lett., 2023)

Plant-and-Steal: Truthful Fair Allocations via Predictions. - Ilan Reuven Cohen; Alon Eden; Talya Eden; Arsen Vasilyan (NeurIPS, 2024)

A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines. - Ilan Reuven Cohen; Izack Cohen; Iyar Zaks (Ann. Oper. Res., 2024)