1. Amir Abboud and Søren Dahlgaard . 2016. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms . In FOCS. IEEE Computer Society , 477–486. Amir Abboud and Søren Dahlgaard. 2016. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. In FOCS. IEEE Computer Society, 477–486.
2. Amir Abboud and Virginia Vassilevska Williams . 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems . In FOCS. IEEE Computer Society , 434–443. Amir Abboud and Virginia Vassilevska Williams. 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In FOCS. IEEE Computer Society, 434–443.
3. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In ICALP (LIPIcs, Vol. 107);Arar Moab;Schloss Dagstuhl - Leibniz-Zentrum für Informatik,2018
4. Sepehr Assadi , Soheil Behnezhad , Sanjeev Khanna , and Huan Li. 2022. On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs/2207.09354 ( 2022 ). Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, and Huan Li. 2022. On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs/2207.09354 (2022).
5. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs