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:683394f0b0991
DTSTART;TZID=America/Toronto:20230216T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230216T113000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-distance-estimation-in-modern-graphs-algorithms-and-impossibility
SUMMARY:Seminar • Algorithms and Complexity • Distance-Estimation in\nM
 odern Graphs: Algorithms and Impossibility
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 130
 4 AND VIRTUALLY\nOVER ZOOM.\n\nNICOLE WEIN\, SIMONS POSTDOCTORAL LEADER\n_
 DIMACS\, Rutgers University_\n\nThe size and complexity of today’s graph
 s present challenges that\nnecessitate the discovery of new algorithms. On
 e central area of\nresearch in this endeavor is computing and estimating d
 istances in\ngraphs. In this talk I will discuss two fundamental families 
 of\ndistance problems in the context of modern graphs:\nDiameter/Radius/Ec
 centricities and Hopsets/Shortcut Sets.\n 
DTSTAMP:20250525T220848Z
END:VEVENT
END:VCALENDAR