Yasamin Nazari

Full Name

Y Nazari

Email

Yasamin.Nazari@cwi.nl

Phone

+31 20 592 4101

Room

M232a

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