BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:All-Pairs-Shortest-Path and Related Problems: Reductions and Algor
 ithms
DTSTART:20130812T160000
DTSTAMP:20260509T234513Z
UID:d12f5657dd8d7748b0f02208944c5f75261ba7acfe82b62341144e7a
CATEGORIES:Conferences - Seminars
DESCRIPTION:Ms Farah Charab\nEDIC Candidacy Exam:\nExam president: Prof. R
 udiger Urbanke\nThesis director: Prof. Aleksander Madry\nCo-examiner: Prof
 . Volkan CevherResearch Proposal\nFast Approximation Algorithms for the Di
 ameter and the Radius of Sparse Graphs by Liam Roditty and Virginia Vassli
 evska Williams.On the All-Pairs-Shortest-Path Problem Unweighted Undirecte
 d Graphs by R. Seidel.Subcubic Equivalences Between Path\, Matrix and Tria
 ngle Problems by Virginia Vassilevska.
LOCATION:INF211 http://plan.epfl.ch/?lang=fr&room=inf211
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR