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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0a0862181a
DTSTART;TZID=America/Toronto:20220121T090000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220121T090000
URL:https://uwaterloo.ca/computer-science/events/phd-defence-algorithms-com
 plexity-related-orderings-of-at-free-graphs
LOCATION:200 University Avenue West Online PhD defence Waterloo ON N2L 3G1 
 Canada
SUMMARY:PhD Defence • Algorithms and Complexity • Related Orderings of\
 nAT-Free Graphs
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS PHD DEFENCE WILL BE GIVEN ONLINE.\n\nJAN GORZ
 NY\, PHD CANDIDATE\n_David R. Cheriton School of Computer Science_\n\nSUPE
 RVISOR: Professor Jonathan Buss\n\nAn asteroidal triple (AT) is a triple o
 f independent vertices x\, y\, z\nsuch that between every pair of vertices
  in the triple\, there is a\npath that does not intersect the closed neigh
 bourhood of the third. A\ngraph without an asteroidal triple is said to be
  AT-free.
DTSTAMP:20260404T052422Z
END:VEVENT
END:VCALENDAR