How Asynchrony Affects Rumor Spreading Time. - George Giakkoupis; Yasamin Nazari; Philipp Woelfel (PODC, 2016)

Distributed Distance-Bounded Network Design Through Distributed Convex Programming. - Michael Dinitz; Yasamin Nazari (OPODIS, 2017)

Approximating k-spanners in the LOCAL model. - Michael Dinitz; Yasamin Nazari (CoRR, 2017)

Distributed Approximate Distance Oracles. - Michael Dinitz; Yasamin Nazari (CoRR, 2018)

Massively Parallel Approximate Distance Sketches. - Michael Dinitz; Yasamin Nazari (OPODIS, 2019)

Sparse Hopsets in Congested Clique. - Yasamin Nazari (OPODIS, 2019)

Brief Announcement: Massively Parallel Approximate Distance Sketches. - Michael Dinitz; Yasamin Nazari (DISC, 2019)

Lasserre Integrality Gaps for Graph Spanners and Related Problems. - Michael Dinitz; Yasamin Nazari; Zeyu Zhang 003 (WAOA, 2020)

Near-Optimal Decremental Approximate Multi-Source Shortest Paths. - Jakub Lacki; Yasamin Nazari (CoRR, 2020)

Massively Parallel Algorithms for Distance Approximation and Spanners. - Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari 001; Slobodan Mitrovic; Yasamin Nazari (SPAA, 2021)

Fast Deterministic Fully Dynamic Distance Approximation. - Jan van den Brand; Sebastian Forster; Yasamin Nazari (FOCS, 2022)

Near-Optimal Decremental Hopsets with Applications. - Jakub Lacki; Yasamin Nazari (ICALP, 2022)

Vertex Fault-Tolerant Emulators. - Greg Bodwin; Michael Dinitz; Yasamin Nazari (ITCS, 2022)

Online Allocation and Display Ads Optimization with Surplus Supply. - Melika Abolhassani; Hossein Esfandiari; Yasamin Nazari; Balasubramanian Sivan; Yifeng Teng; Creighton Thomas (WINE, 2022)

Dynamic Graph Algorithms (Dagstuhl Seminar 22461). - Aaron Bernstein; Shiri Chechik; Sebastian Forster; Tsvi Kopelowitz; Yasamin Nazari; Nicole Wein (Dagstuhl Reports, 2022)

Bootstrapping Dynamic Distance Oracles. - Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (ESA, 2023)

Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. - Greg Bodwin; Michael Dinitz; Yasamin Nazari (ITCS, 2023)

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. - Sebastian Forster; Yasamin Nazari; Maximilian Probst Gutenberg (STOC, 2023)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (CoRR, 2023)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. - Michal Dory; Sebastian Forster; Yasamin Nazari; Tijn de Vos (ICALP, 2024)

On Dynamic Graph Algorithms with Predictions. - Jan van den Brand; Sebastian Forster; Yasamin Nazari; Adam Polak 001 (SODA, 2024)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (SODA, 2024)

Fast 2-Approximate All-Pairs Shortest Paths. - Michal Dory; Sebastian Forster; Yael Kirkpatrick; Yasamin Nazari; Virginia Vassilevska Williams; Tijn de Vos (SODA, 2024)

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471). - Keren Censor-Hillel; Yasamin Nazari; Eva Rotenberg; Thatchaphol Saranurak; Martín Costa (Dagstuhl Reports, 2024)

Approximation Algorithms for Optimal Hopsets. - Michael Dinitz; Ama Koranteng; Yasamin Nazari (ICALP, 2025)