Yasamin Nazari

Full Name

Y Nazari

Email

Yasamin.Nazari@cwi.nl

Department(s)

Networks and Optimization

Function(s)

Researcher

Yasamin Nazari

Dory, M., Forster, S., Nazari, Y., & de Vos, T. (2024). New tradeoffs for decremental approximate all-pairs shortest paths. In Proceedings of ICALP 2024 (pp. 58:1–58:19). doi:10.4230/LIPIcs.ICALP.2024.58
van den Brand, M., Forster, S., Nazari, Y., & Polak, A. (2024). On dynamic graph algorithms with predictions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3534–3557). doi:10.1137/1.9781611977912.126
Cruciani, E., Forster, S., Goranci, G., Nazari, Y., & Skarlatos, A. (2024). Dynamic algorithms for k-center on graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3441–3462). doi:10.1137/1.9781611977912.123
Dory, M., Forster, S., Kirkpatrick, Y., Nazari, Y., Vassilevska Williams, V., & de Vos, T. (2024). Fast 2-approximate all-pairs shortest paths. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4728–4757). doi:10.1137/1.9781611977912.169
Forster, S., Goranci, G., Nazari, Y., & Skarlatos, A. (2023). Bootstrapping dynamic distance oracles. In Annual European Symposium on Algorithms (pp. 50:1–50:16). doi:10.4230/LIPIcs.ESA.2023.50
Forster, S., Nazari, Y., & Probst Gutenberg, M. (2023). Deterministic Incremental APSP with polylogarithmic update time and stretch. In Proceedings of the annual ACM symposium on Theory of Computing (pp. 1173–1186). doi:10.1145/3564246.3585213
Bodwin, G., M. Dinitz, & Nazari, Y. (2023). Epic fail: Emulators can tolerate polynomially many edge faults for free. In Innovations in Theoretical Computer Science Conference (pp. 20:1–20:22). doi:10.4230/LIPIcs.ITCS.2023.20

Committee member: Program Committee STOC
Committee member: Program Committee SOSA