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:69dfcabf635fd
DTSTART;TZID=America/Toronto:20230201T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230201T150000
URL:https://uwaterloo.ca/computer-science/events/phd-seminar-algorithms-com
 plexity-distance-oracles-for-interval-graphs-via-breadth-first-rank-select
 -in-succinct-trees
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 • Distance Oracles for\
 nInterval Graphs via Breadth-First Rank/Select in Succinct Trees
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS PHD SEMINAR WILL TAKE PLACE IN DC 1304 AND VI
 RTUALLY\nOVER ZOOM.\n\nKAIYU (KEVIN) WU\, PHD CANDIDATE\n_David R. Cherito
 n School of Computer Science_\n\nSUPERVISOR: Professor J. Ian Munro\n\nWe 
 present succinct distance oracles for (unweighted) interval graphs\nand re
 lated classes of graphs\, using a novel succinct data structure\nfor ordin
 al trees that supports the mapping between preorder (i.e.\,\ndepth-first) 
 ranks and level-order (breadth-first) ranks of nodes in\nconstant time.
DTSTAMP:20260415T172831Z
END:VEVENT
END:VCALENDAR