Yonatan Naamad: Hardness from Densest Subgraph Conjectures. Princeton University, USA 2017