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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cfd5b96eed2
DTSTART;TZID=America/Toronto:20230324T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230324T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-david-aleman-2
SUMMARY:Combinatorial Optimization Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:TITLE: Subgraph Polytopes and Independence Polytopes of Count M
 atroids\n\nSpeaker:\n David Aleman\n\nAffiliation:\n University of Waterlo
 o\n\nLocation:\n MC 6029\n\nABSTRACT: Given a graph G=(V\,E)\, the subgrap
 h polytope of G is defined\nas the convex hull of the characteristic vecto
 r of the pairs (S\,F)\nsuch that S is a non-empty subset of vertices and F
  is a set of edges\ncontained in the induced subgraph G[S].
DTSTAMP:20260403T145905Z
END:VEVENT
END:VCALENDAR