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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6875837db738d
DTSTART;TZID=America/Toronto:20180528T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180528T100000
URL:/computer-science/events/phd-defence-algorithms-and
 -complexity-shortest-paths
SUMMARY:PhD Defence • Algorithms and Complexity — Shortest Paths in\nGe
 ometric Intersection Graphs
CLASS:PUBLIC
DESCRIPTION:Summary \n\nDIMITRIOS SKREPETOS\, PHD CANDIDATE\n_David R. Cher
 iton School of Computer Science_\n 
DTSTAMP:20250714T222357Z
END:VEVENT
END:VCALENDAR