default search action
Yasamin Nazari
Person information
- affiliation: Vrije Universiteit Amsterdam, The Netherands
- affiliation (former): Salzburg University, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Michal Dory, Sebastian Forster, Yasamin Nazari
, Tijn de Vos:
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP 2024: 58:1-58:19 - [c17]Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari
Dynamic algorithms for k-center on graphs. SODA 2024: 3441-3462 - [c16]Jan van den Brand
On Dynamic Graph Algorithms with Predictions. SODA 2024: 3534-3557 - [c15]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari
Fast 2-Approximate All-Pairs Shortest Paths. SODA 2024: 4728-4757 - 2023
- [c14]Sebastian Forster, Gramoz Goranci, Yasamin Nazari
Bootstrapping Dynamic Distance Oracles. ESA 2023: 50:1-50:16 - [c13]Greg Bodwin, Michael Dinitz, Yasamin Nazari
Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. ITCS 2023: 20:1-20:22 - [c12]Sebastian Forster, Yasamin Nazari
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. STOC 2023: 1173-1186 - [i17]Sebastian Forster, Gramoz Goranci, Yasamin Nazari
Bootstrapping Dynamic Distance Oracles. CoRR abs/2303.06102 (2023) - [i16]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. CoRR abs/2307.09258 (2023) - [i15]Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak:
On Dynamic Graph Algorithms with Predictions. CoRR abs/2307.09961 (2023) - [i14]Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos:
Dynamic algorithms for k-center on graphs. CoRR abs/2307.15557 (2023) - 2022
- [c11]Jan van den Brand
Fast Deterministic Fully Dynamic Distance Approximation. FOCS 2022: 1011-1022 - [c10]Jakub Lacki, Yasamin Nazari
Near-Optimal Decremental Hopsets with Applications. ICALP 2022: 86:1-86:20 - [c9]Greg Bodwin, Michael Dinitz, Yasamin Nazari
Vertex Fault-Tolerant Emulators. ITCS 2022: 25:1-25:22 - [c8]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari
Online Allocation and Display Ads Optimization with Surplus Supply. WINE 2022: 41-59 - [i13]Greg Bodwin, Michael Dinitz, Yasamin Nazari
Epic Fail: Emulators can tolerate polynomially many edge faults for free. CoRR abs/2209.03675 (2022) - [i12]Michal Dory, Sebastian Forster, Yasamin Nazari
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR abs/2211.01152 (2022) - [i11]Sebastian Forster, Yasamin Nazari
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. CoRR abs/2211.04217 (2022) - [i10]Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein:
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12(11): 45-65 (2022) - 2021
- [c7]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA 2021: 118-128 - [i9]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas:
Online Allocation and Display Ads Optimization with Surplus Supply. CoRR abs/2107.06980 (2021) - [i8]Greg Bodwin, Michael Dinitz, Yasamin Nazari:
Vertex Fault-Tolerant Emulators. CoRR abs/2109.08042 (2021) - [i7]Jan van den Brand, Sebastian Forster, Yasamin Nazari:
Fast Deterministic Fully Dynamic Distance Approximation. CoRR abs/2111.03361 (2021) - 2020
- [c6]Michael Dinitz, Yasamin Nazari
Lasserre Integrality Gaps for Graph Spanners and Related Problems. WAOA 2020: 97-112 - [i6]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR abs/2003.01254 (2020) - [i5]Jakub Lacki, Yasamin Nazari:
Near-Optimal Decremental Approximate Multi-Source Shortest Paths. CoRR abs/2009.08416 (2020)
2010 – 2019
- 2019
- [c5]Yasamin Nazari
Sparse Hopsets in Congested Clique. OPODIS 2019: 34:1-34:16 - [c4]Michael Dinitz
Massively Parallel Approximate Distance Sketches. OPODIS 2019: 35:1-35:17 - [c3]Michael Dinitz, Yasamin Nazari
Brief Announcement: Massively Parallel Approximate Distance Sketches. DISC 2019: 42:1-42:3 - [i4]Michael Dinitz, Yasamin Nazari, Zeyu Zhang:
Lasserre Integrality Gaps for Graph Spanners and Related Problems. CoRR abs/1905.07468 (2019) - [i3]Yasamin Nazari:
Sparse Hopsets in Congested Clique. CoRR abs/1911.07154 (2019) - 2018
- [i2]Michael Dinitz, Yasamin Nazari:
Distributed Approximate Distance Oracles. CoRR abs/1810.09027 (2018) - 2017
- [c2]Michael Dinitz
Distributed Distance-Bounded Network Design Through Distributed Convex Programming. OPODIS 2017: 5:1-5:19 - [i1]Michael Dinitz, Yasamin Nazari:
Approximating k-spanners in the LOCAL model. CoRR abs/1703.07417 (2017) - 2016
- [c1]George Giakkoupis, Yasamin Nazari
How Asynchrony Affects Rumor Spreading Time. PODC 2016: 185-194
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: