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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68328f086d8cb
DTSTART;TZID=America/Toronto:20220713T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220713T140000
URL:/computer-science/events/phd-seminar-algorithms-and
 -complexity-adjacency-and-distance-sketching-for-graphs
SUMMARY:PhD Seminar • Algorithms and Complexity • Adjacency and Distanc
 e\nSketching for Graphs
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS PHD SEMINAR WILL TAKE PLACE IN DC
  1304 AND ONLINE.\n\nNATHAN HARMS\, PHD CANDIDATE\n_David R. Cheriton Scho
 ol of Computer Science_\n\nSUPERVISOR: Professor Eric Blais\n 
DTSTAMP:20250525T033120Z
END:VEVENT
END:VCALENDAR