Yasamin Nazari

Orcid: 0000-0003-1315-9355

Affiliations:
  • Vrije Universiteit Amsterdam, The Netherands
  • Salzburg University, Austria (former)


According to our database1, Yasamin Nazari authored at least 23 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast 2-Approximate All-Pairs Shortest Paths.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic algorithms for <i>k</i>-center on graphs.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On Dynamic Graph Algorithms with Predictions.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Dynamic algorithms for k-center on graphs.
CoRR, 2023

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Bootstrapping Dynamic Distance Oracles.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Dynamic Graph Algorithms (Dagstuhl Seminar 22461).
Dagstuhl Reports, November, 2022

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths.
CoRR, 2022

Online Allocation and Display Ads Optimization with Surplus Supply.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Vertex Fault-Tolerant Emulators.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Near-Optimal Decremental Hopsets with Applications.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Fast Deterministic Fully Dynamic Distance Approximation.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Massively Parallel Algorithms for Distance Approximation and Spanners.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020
Near-Optimal Decremental Approximate Multi-Source Shortest Paths.
CoRR, 2020

Lasserre Integrality Gaps for Graph Spanners and Related Problems.
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

2019
Brief Announcement: Massively Parallel Approximate Distance Sketches.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Sparse Hopsets in Congested Clique.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Massively Parallel Approximate Distance Sketches.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018
Distributed Approximate Distance Oracles.
CoRR, 2018

2017
Approximating k-spanners in the LOCAL model.
CoRR, 2017

Distributed Distance-Bounded Network Design Through Distributed Convex Programming.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
How Asynchrony Affects Rumor Spreading Time.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016


  Loading...