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:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dfb27164eff
DTSTART;TZID=America/Toronto:20221202T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221202T150000
URL:https://uwaterloo.ca/computer-science/events/phd-seminar-algorithms-and
 -complexity-shortest-beer-path-queries-in-interval-graphs
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West Hybrid: DC 1304 | Online PhD seminar Waterloo ON N2L 3G1 Canada
SUMMARY:PhD Seminar • Algorithms and Complexity • Shortest Beer Path\nQ
 ueries in Interval Graphs
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS PHD SEMINAR WILL TAKE PLACE IN DC 1304 AND ON
 LINE.\n\nKEVIN WU\, PHD CANDIDATE\n_David R. Cheriton School of Computer S
 cience_\n\nSUPERVISOR: Professor Ian Munro\n\nOur interest is in paths bet
 ween pairs of vertices that go through at\nleast one of a subset of the ve
 rtices known as beer vertices. Such a\npath is called a beer path\, and th
 e beer distance between two vertices\nis the length of the shortest beer p
 ath.
DTSTAMP:20260415T154449Z
END:VEVENT
END:VCALENDAR