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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e0f00a10827
DTSTART;TZID=America/Toronto:20220218T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220218T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-chandra-chekuri
SUMMARY:Tutte Colloquium - Chandra Chekuri
CLASS:PUBLIC
DESCRIPTION:TITLE: Densest Subgraph: Supermodularity\, Iterative Peeling\,
  and Flow\n\nSpeaker:\n Chandra Chekuri\n\nAffiliation:\n University of Il
 linois\, Urbana-Champaign\n\nZoom:\n Please email Emma Watson\n\nABSTRACT
 :\n\nThe densest subgraph problem in a graph (DSG)\, in the simplest form\
 ,\nis the following. Given an undirected graph G = (V\, E) find a subset S
 \nof vertices that maximizes the ratio |E(S)|/|S| where E(S) is the set\no
 f edges with both endpoints in S. DSG and several of its variants are\nwel
 l-studied in theory and practice and have many applications in data\nminin
 g and network analysis.
DTSTAMP:20260416T141954Z
END:VEVENT
END:VCALENDAR