Education Research Current About VU Amsterdam NL
Login as
Prospective student Student Employee
Bachelor Master VU for Professionals
Exchange programme VU Amsterdam Summer School Honours programme VU-NT2 Semester in Amsterdam
PhD at VU Amsterdam Research highlights Prizes and distinctions
Research institutes Our scientists Research Impact Support Portal Creating impact
News Events calendar Woman at the top
Israël and Palestinian regions Culture on campus
Practical matters Mission and core values Entrepreneurship on VU Campus
Organisation Partnerships Alumni University Library Working at VU Amsterdam
Sorry! De informatie die je zoekt, is enkel beschikbaar in het Engels.
This programme is saved in My Study Choice.
Something went wrong with processing the request.
Something went wrong with processing the request.

Yasamin Nazari: Distance Structures and Algorithmic Applications 24 April 2025 16:00 - 17:00

Share
In this seminar, Yasamin Nazari will give a talk about Distance Structures and their Algorithmic Applications.

In recent years there has been a growing interest in studying graph theoretical structures used for designing efficient algorithms in various computational models, such as dynamic, parallel and distributed models.

In this talk, we focus on distance structures which are objects that preserve approximate distances in a graph, but tradeoff this approximation factor with space, query time, or the number of hops on the approximate shortest paths. We describe how these structures can be utilized for faster shortest path computation in dynamic and parallel models. Finally, we discuss their application in related problems such as graph clustering.

About Yasamin Nazari: Distance Structures and Algorithmic Applications

Starting date

  • 24 April 2025

Time

  • 16:00 - 17:00

Location

  • VU Main Building

Address

  • De Boelelaan 1105
  • 1081 HV Amsterdam

Organised by

  • Operations Analytics

Language

  • English

Yasamin Nazari

Yasamin Nazari

Yasamin Nazari is an Assistant Professor Theoretical Computer Science group of the Vrije Universiteit Amsterdam. She also has a partial affiliation at the CWI. She was a postdoctoral researcher at University of Salzburg in Austria working with Sebastian Forster. She completed her PhD at Johns Hopkins University, where she was advised by Mike Dinitz, and her masters at University of Calgary in Canada.

Yasamin is broadly interested in algorithms and theoretical computer science, with an emphasis on graph algorithms in various computational settings (dynamic, distributed, etc). She looks at graph theoretical structures that can be used to improve running time or memory of solving fundamental computational tasks. She is also interested in approximation and online algorithms, and the interplay of these topics.

Interested in attending the seminar or in giving a talk?

Please send an email to Tim Oosterwijk

Quick links

Homepage Culture on campus VU Sports Centre Dashboard

Study

Academic calendar Study guide Timetable Canvas

Featured

VUfonds VU Magazine Ad Valvas Digital accessibility

About VU

Contact us Working at VU Amsterdam Faculties Divisions
Privacy Disclaimer Veiligheid Webcolofon Cookies Webarchief

Copyright © 2025 - Vrije Universiteit Amsterdam