| No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ A Bazzi, S Fiorini, S Pokutta, O Svensson Mathematics of Operations Research 44 (1), 147-172, 2019 | 46 | 2019 |
| An efficient streaming algorithm for the submodular cover problem A Norouzi-Fard, A Bazzi, I Bogunovic, M El Halabi, YP Hsieh, V Cevher Advances in Neural Information Processing Systems 29, 2016 | 25 | 2016 |
| Towards tight lower bounds for scheduling problems A Bazzi, A Norouzi-Fard Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 22 | 2015 |
| Small extended formulation for knapsack cover inequalities from monotone circuits A Bazzi, S Fiorini, S Huang, O Svensson Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 16 | 2017 |
| Strengths and Limitations of Linear Programming Relaxations A Bazzi EPFL, 2017 | 2 | 2017 |
| No Small Linear Program Approximates Vertex Cover Within a Factor 2−< italic> ɛ A Bazzi, S Fiorini, S Pokutta, O Svensson | | 2019 |
| Hardness of Approximation and Iterative Rounding Algorithms A Bazzi | | |
