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:682f06a1bb88c
DTSTART;TZID=America/Toronto:20220525T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220525T123000
URL:/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-testing-vertex-connectivity-of-bowtie-1-plane-
 graphs
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity •\nT
 esting Vertex Connectivity of Bowtie 1-plane Graphs
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WI
 LL BE GIVEN IN\nPERSON IN DC AS WELL AS ONLINE.\n\nKARTHIK MURALI\, MASTER
 ’S CANDIDATE\n_David R. Cheriton School of Computer Science_\n\nSUPERVIS
 OR: Professor Therese Biedl\n 
DTSTAMP:20250522T111233Z
END:VEVENT
END:VCALENDAR