1. Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
2. Amir Abboud Karl Bringmann Seri Khoury and Or Zamir. 2022. Hardness of Approximation in P via Short Cycle Removal: Cycle Detection Distance Oracles and Beyond. arXiv preprint arXiv:2204.10465.
3. Baruch Awerbuch, Yossi Azar, and Serge A. Plotkin. 1993. Throughput-Competitive On-Line Routing. In 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993. 32–40.
4. Kyriakos Axiotis, Aleksander Madry, and Adrian Vladu. 2020. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. 93–104.
5. Aaron Bernstein. 2017. Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. In LIPIcs-Leibniz International Proceedings in Informatics. 80.