BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d5bc017c16d
DTSTART;TZID=America/Toronto:20231220T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231220T120000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-compact-routing-on-planar-graphs
LOCATION:200 University Avenue West Online master’s thesis presentation W
 aterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity •\nC
 ompact Routing on Planar Graphs
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WILL TAKE PLAC
 E\nONLINE.\n\nNEWSHA SEYEDI\, MASTER’S CANDIDATE\n_David R. Cheriton Sch
 ool of Computer Science_\n\nSUPERVISOR: Professor Ian Munro\n\nThis thesis
  delves into the exploration of shortest path queries in\nplanar graphs\, 
 with an emphasis on the utilization of space-efficient\ndata structures. O
 ur investigation primarily targets connected\,\nundirected\, static pointe
 r planar graphs\, focusing on scenarios where\nqueries predominantly start
  or end at a select subset of nodes.
DTSTAMP:20260408T022257Z
END:VEVENT
END:VCALENDAR