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:69e012a6c4ca9
DTSTART;TZID=America/Toronto:20230216T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230216T113000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-distance-estimation-in-modern-graphs-algorithms-and-impossibility
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West Hybrid: DC 1304 | Online seminar Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity • Distance-Estimation in\nM
 odern Graphs: Algorithms and Impossibility
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 1304 AND VIRTUA
 LLY\nOVER ZOOM.\n\nNICOLE WEIN\, SIMONS POSTDOCTORAL LEADER\n_DIMACS\, Rut
 gers University_\n\nThe size and complexity of today’s graphs present ch
 allenges that\nnecessitate the discovery of new algorithms. One central ar
 ea of\nresearch in this endeavor is computing and estimating distances in\
 ngraphs. In this talk I will discuss two fundamental families of\ndistance
  problems in the context of modern graphs:\nDiameter/Radius/Eccentricities
  and Hopsets/Shortcut Sets.
DTSTAMP:20260415T223518Z
END:VEVENT
END:VCALENDAR