Towards Tight Lower Bounds for Scheduling Problems. - Abbas Bazzi; Ashkan Norouzi-Fard (ESA, 2015)

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. - Abbas Bazzi; Samuel Fiorini; Sebastian Pokutta; Ola Svensson (FOCS, 2015)

No Small Linear Program Approximates Vertex Cover within a Factor 2-ε. - Abbas Bazzi; Samuel Fiorini; Sebastian Pokutta; Ola Svensson (CoRR, 2015)

An Efficient Streaming Algorithm for the Submodular Cover Problem. - Ashkan Norouzi-Fard; Abbas Bazzi; Ilija Bogunovic; Marwa El Halabi; Ya-Ping Hsieh; Volkan Cevher (NIPS, 2016)

Strengths and Limitations of Linear Programming Relaxations. - Abbas Bazzi (2017)

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. - Abbas Bazzi; Samuel Fiorini; Sangxia Huang; Ola Svensson (Theory Comput., 2018)

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ. - Abbas Bazzi; Samuel Fiorini; Sebastian Pokutta; Ola Svensson (Math. Oper. Res., 2019)