Yasamin Nazari

39 papers A* 9A 4B 5Journal 20Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Approximation Algorithms for Optimal Hopsets. ICALP Michael Dinitz, Ama Koranteng, Yasamin Nazari
2025	J	`jnl`	Approximation Algorithms for Optimal Hopsets. CoRR Michael Dinitz, Ama Koranteng, Yasamin Nazari
2025	J	`jnl`	Greedy Algorithms for Shortcut Sets and Hopsets. CoRR Ben Bals, Joakim Blikstad, Greg Bodwin, Daniel Dadush, Sebastian Forster, Yasamin Nazari
2024	A*	`conf`	Dynamic algorithms for SODA Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2024	A*	`conf`	Fast 2-Approximate All-Pairs Shortest Paths. SODA Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2024	J	`jnl`	Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471). Dagstuhl Reports Keren Censor-Hillel, Yasamin Nazari, Eva Rotenberg, Thatchaphol Saranurak, Martín Costa
2024	A*	`conf`	New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2024	A*	`conf`	On Dynamic Graph Algorithms with Predictions. SODA Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
2023	A	`conf`	Bootstrapping Dynamic Distance Oracles. ESA Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023	J	`jnl`	Bootstrapping Dynamic Distance Oracles. CoRR Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023	A*	`conf`	Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. STOC Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
2023	J	`jnl`	Dynamic algorithms for k-center on graphs. CoRR Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023	A	`conf`	Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. ITCS Greg Bodwin, Michael Dinitz, Yasamin Nazari
2023	J	`jnl`	Fast 2-Approximate All-Pairs Shortest Paths. CoRR Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2023	J	`jnl`	On Dynamic Graph Algorithms with Predictions. CoRR Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
2022	J	`jnl`	Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. CoRR Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
2022	J	`jnl`	Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
2022	J	`jnl`	Epic Fail: Emulators can tolerate polynomially many edge faults for free. CoRR Greg Bodwin, Michael Dinitz, Yasamin Nazari
2022	A*	`conf`	Fast Deterministic Fully Dynamic Distance Approximation. FOCS Jan van den Brand, Sebastian Forster, Yasamin Nazari
2022	A*	`conf`	Near-Optimal Decremental Hopsets with Applications. ICALP Jakub Lacki, Yasamin Nazari
2022	J	`jnl`	New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2022	—	`conf`	Online Allocation and Display Ads Optimization with Surplus Supply. WINE Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas
2022	A	`conf`	Vertex Fault-Tolerant Emulators. ITCS Greg Bodwin, Michael Dinitz, Yasamin Nazari
2021	J	`jnl`	Fast Deterministic Fully Dynamic Distance Approximation. CoRR Jan van den Brand, Sebastian Forster, Yasamin Nazari
2021	B	`conf`	Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
2021	J	`jnl`	Online Allocation and Display Ads Optimization with Surplus Supply. CoRR Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas
2021	J	`jnl`	Vertex Fault-Tolerant Emulators. CoRR Greg Bodwin, Michael Dinitz, Yasamin Nazari
2020	B	`conf`	Lasserre Integrality Gaps for Graph Spanners and Related Problems. WAOA Michael Dinitz, Yasamin Nazari, Zeyu Zhang
2020	J	`jnl`	Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
2020	J	`jnl`	Near-Optimal Decremental Approximate Multi-Source Shortest Paths. CoRR Jakub Lacki, Yasamin Nazari
2019	A	`conf`	Brief Announcement: Massively Parallel Approximate Distance Sketches. DISC Michael Dinitz, Yasamin Nazari
2019	J	`jnl`	Lasserre Integrality Gaps for Graph Spanners and Related Problems. CoRR Michael Dinitz, Yasamin Nazari, Zeyu Zhang
2019	B	`conf`	Massively Parallel Approximate Distance Sketches. OPODIS Michael Dinitz, Yasamin Nazari
2019	B	`conf`	Sparse Hopsets in Congested Clique. OPODIS Yasamin Nazari
2019	J	`jnl`	Sparse Hopsets in Congested Clique. CoRR Yasamin Nazari
2018	J	`jnl`	Distributed Approximate Distance Oracles. CoRR Michael Dinitz, Yasamin Nazari
2017	J	`jnl`	Approximating k-spanners in the LOCAL model. CoRR Michael Dinitz, Yasamin Nazari
2017	B	`conf`	Distributed Distance-Bounded Network Design Through Distributed Convex Programming. OPODIS Michael Dinitz, Yasamin Nazari
2016	A*	`conf`	How Asynchrony Affects Rumor Spreading Time. PODC George Giakkoupis, Yasamin Nazari, Philipp Woelfel