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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e15fe783668
DTSTART;TZID=America/Toronto:20220323T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220323T130000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-almost-linear-time-algorithms-for-max-flow-and-more
LOCATION:200 University Avenue West Online seminar Waterloo ON N2L 3G1 Cana
 da
SUMMARY:Seminar • Algorithms and Complexity • Almost Linear Time\nAlgor
 ithms for Max-flow and More
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL BE GIVEN ONLINE.\n\nSUSHANT SACH
 DEVA\, ASSISTANT PROFESSOR\n_Department of Computer Science\, University o
 f Toronto_\n\nWe give the first almost-linear time algorithm for computing
  exact\nmaximum flows and minimum-cost flows on directed graphs. By well k
 nown\nreductions\, this implies almost-linear time algorithms for several\
 nproblems including bipartite matching\, optimal transport\, and\nundirect
 ed vertex connectivity.
DTSTAMP:20260416T221711Z
END:VEVENT
END:VCALENDAR