| Online algorithms for covering and packing problems with convex objectives Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ... 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 86 | 2016 |
| Tight bounds for online vector bin packing Y Azar, IR Cohen, S Kamara, B Shepherd Proceedings of the forty-fifth annual ACM symposium on Theory of Computing …, 2013 | 75 | 2013 |
| Tight bounds for online edge coloring IR Cohen, B Peng, D Wajc 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 1-25, 2019 | 47 | 2019 |
| Randomized online matching in regular graphs IR Cohen, D Wajc Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 46 | 2018 |
| Packing small vectors Y Azar, IR Cohen, A Fiat, A Roytman Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 33 | 2016 |
| Pricing online decisions: Beyond auctions IR Cohen, A Eden, A Fiat, Ł Jeż Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014 | 33 | 2014 |
| Online lower bounds via duality Y Azar, IR Cohen, A Roytman Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 31 | 2017 |
| Online covering with convex objectives and applications Y Azar, IR Cohen, D Panigrahi arXiv preprint arXiv:1412.3507, 2014 | 20 | 2014 |
| A general framework for learning-augmented online allocation IR Cohen, D Panigrahi arXiv preprint arXiv:2305.18861, 2023 | 15 | 2023 |
| Randomized algorithms for online vector load balancing Y Azar, IR Cohen, D Panigrahi Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 14 | 2018 |
| The loss of serving in the dark Y Azar, IR Cohen, I Gamzu Proceedings of the forty-fifth annual ACM symposium on Theory of Computing …, 2013 | 10 | 2013 |
| Plant-and-steal: Truthful fair allocations via predictions IR Cohen, A Eden, T Eden, A Vasilyan Advances in Neural Information Processing Systems 37, 110057-110096, 2024 | 7 | 2024 |
| Resource allocation in ordinal classification problems: A prescriptive framework utilizing machine learning and mathematical programming L Rabkin, I Cohen, G Singer Engineering Applications of Artificial Intelligence 132, 107914, 2024 | 7 | 2024 |
| Contention resolution, matrix scaling and fair allocation N Bansal, IR Cohen International Workshop on Approximation and Online Algorithms, 252-274, 2021 | 5 | 2021 |
| Online two-dimensional load balancing I Cohen, S Im, D Panigrahi 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 5 | 2020 |
| Dynamic pricing of servers on trees IR Cohen, A Eden, A Fiat, Ł Jeż Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 5 | 2019 |
| Serving in the dark should be done non-uniformly Y Azar, IR Cohen International Colloquium on Automata, Languages, and Programming, 91-102, 2015 | 5 | 2015 |
| Truly asymptotic lower bounds for online vector bin packing: J. Balogh et al. J Balogh, IR Cohen, L Epstein, A Levin Mathematical Programming, 1-31, 2025 | 3 | 2025 |
| Primal-dual schemes for online matching in bounded degree graphs IR Cohen, B Peng 31st Annual European Symposium on Algorithms (ESA 2023), 35: 1-35: 17, 2023 | 3 | 2023 |
| Stochastic graph exploration A Anagnostopoulos, IR Cohen, S Leonardi, J Lacki LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS 132, 2019 | 3 | 2019 |
